Answer of 2nd mcq

#1

we are using binary search, so time complexity should be logarithmic.

#2

@manikNFt Yeah the time complexity of binary search is log2(n).

#4

but the answer is saying it is taking linear time to search last element 20

#5

@manikNFt Can u send me the question ? Link or maybe screenshot?

#6

Screenshot%20(127)
Screenshot%20(127)1920×1080 180 KB

in this question, the answer given is option B, my question is how the time complexity in using binary_search is linear??

#7

@manikNFt Yes you are correct. We’ll change that ASAP. Thank you for telling us.

#8

@manikNFt @amankumarkeshu
sorry to interrupt u guys
actually it should be O(n) only, because we are applying binary search on linked list .
everytime we need to find n/2th by traversing half of the list .
as per recurrence relatation t(n)=t(n/2)+O(n) = O(2*n)=O(n) .
that why it is giving b as correct output

1 Like
#9

Ohk, that’s a new thing i learnt today.
Thanks

#10

@aman212yadav Thank you so much for showing me the error. I actually didn’t see the list in the question. And your answer is totally correct. The time complexity will be 0(n)

1 Like
#11

I hope I’ve cleared your doubt. I ask you to please rate your experience here
Your feedback is very important. It helps us improve our platform and hence provide you
the learning experience you deserve.

On the off chance, you still have some questions or not find the answers satisfactory, you may reopen
the doubt.