Loading practice questions
What is the time complexity of uniform binary search?
Correct Answer: B — O(logn)
Explanation:
With every iteration we are dividing the array into two parts(though not equal halves), the complexity remains same as the normal binary search.