Question

In a binary search algorithm, Which is the worst case scenario:-
1.O(1)
2.O(log n)
3.O(n)
4.O(n/2)
enter reason here

Answer 1

Answer:

c is the answer dear friend.....!