Second question in the quiz

#1

if we are applying binary search then complexity is logarithmic in size of list ,how is it linear in the size of the list?

#2

@Rj.25
Binary seach is logarithmic in complexity. There might have been a mistake in the quiz.
Binary Search is O(Log n).

#3

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.