Let A[1..n] be a sorted array of distinct integers, some of which may be negative
computer science
Description
1) Let A[1..n] be a sorted array of distinct integers, some of which may be negative. Give a recursive O(log n)algorithm that can find an index i such that 1 ≤ i ≤ n and A[i] = i, provided that such an index exists. This means that you need to give the algorithm first and then analyze it. 2) look at screen shot to solve question number 2
