Question

Find the time Complexity of the following code show the process function [b1,x1] = cercano(th,c,s,X) b1 = 0; x1 = 0; m = Distance(c,s,X); x = min(m); if x < th y = find(m==x, 1, 'first');...

Find the time Complexity of the following code

show the process

function [b1,x1] = cercano(th,c,s,X)

b1 = 0;
x1 = 0;
m = Distance(c,s,X);
x = min(m);


if x < th
y = find(m==x, 1, 'first');
x1 = s(y);
b1 = 1;
end
end

0 0
Add a comment Improve this question Transcribed image text
Answer #1

`Hey,

Note: Brother in case of any queries, just comment in box I would be very happy to assist all your queries

The distance function runs in O(n), min function will work in O(n), find function will also work in O(n), else all others are constant operations.

Since all these are independent.

So, the combined complexity will be O(n)

Kindly revert for any queries

Thanks.

Add a comment
Know the answer?
Add Answer to:
Find the time Complexity of the following code show the process function [b1,x1] = cercano(th,c,s,X) b1 = 0; x1 = 0; m = Distance(c,s,X); x = min(m); if x < th y = find(m==x, 1, 'first');...
Your Answer:

Post as a guest

Your Name:

What's your source?

Earn Coins

Coins can be redeemed for fabulous gifts.

Not the answer you're looking for? Ask your own homework help question. Our experts will answer your question WITHIN MINUTES for Free.
Similar Homework Help Questions
ADVERTISEMENT
Free Homework Help App
Download From Google Play
Scan Your Homework
to Get Instant Free Answers
Need Online Homework Help?
Ask a Question
Get Answers For Free
Most questions answered within 3 hours.
ADVERTISEMENT
ADVERTISEMENT
ADVERTISEMENT