Loading practice questions
In which of the cases uniform binary search fails compared to binary search?
(D) Complexity of code
Explanation:
Uniform binary search code is more complex to implement than binary search as it involves mid points to be computed in hand before search.