Question: Given a sorted array of distinct integers A[O..n-1), Write an efficient algorithm based on divide and conquer strategy that finds out whether there is an
Given a sorted array of distinct integers A[O..n-1), Write an efficient algorithm based on divide and conquer strategy that finds out whether there is an index i for which A[i] = i, if so, return index i, else return -1. . Your algorithm should run in time O(log n). Use the editor to format your
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
