How can the binary search have O(n) time complexity

#1

e88f3b43-6f8a-4b4b-aad2-314ca688facc.jpg678×502

#2

hi @hiteshmehra809_c9f950ced91b5a1b,
its log n only dont worry it must be a mistake

#3

Got the point
Thank you !

#4

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.