Question: Modify the binary search routine to support search in an array of infinite size. In particular, you are given as input a sorted array and
Modify the binary search routine to support search in an array of infinite size. In particular, you are given as input a sorted array and a key value K to search for. Call n the position of the smallest value in the array that is equal to or larger than X. Provide an algorithm that can determine n in O(log n) comparisons in the worst case. Explain why your algorithm meets the required time bound.
Step by Step Solution
3.42 Rating (158 Votes )
There are 3 Steps involved in it
Sure the first thing worth mentioning is that in the binary search we are generally given a sorted c... View full answer
Get step-by-step solutions from verified subject matter experts
