Time complexity

#1

Isn’t the time complexity of binary search nlogn?.Then why he is saying that it will take logn time for computation?

#2

@priyeshant1104
hello priyesh,
time complexity of 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.