Question: 2. You are given an infinite array Alt] in which the first n elements are integers in sorted order and the rest are filled with
![2. You are given an infinite array Alt] in which the](https://s3.amazonaws.com/si.experts.images/answers/2024/08/66cdd2465b952_74266cdd24607b45.jpg)
2. You are given an infinite array Alt] in which the first n elements are integers in sorted order and the rest are filled with oo, You are not given n. Describe an algorithm that takes as input an integer r and finds a position in the array containing r, if such a position exists, in O(log n) time
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
