ObjectiveMcq
Print Protected
This page is protected for print. Use the website to view the content.
In which of the cases uniform binary search fails compared to binary search?
Correct Answer: D — Complexity of code
Uniform binary search code is more complex to implement than binary search as it involves mid points to be computed in hand before search.