Given a sorted array of distinct integers A[1,..., n], you want to find out whether there is an index i for which A[i] = i. Give a divide-and-conquer algorithm that runs in time O (log n).
We need at least 10 more requests to produce the solution.
0 / 10 have requested this problem solution
The more requests, the faster the answer.