Question

Given a sorted array of distinct integers A [0 . . . n-1], find out whether there is an index i for which A[i] = K where K is the given Key. Give a divide-and-conquer algorithm that runs in time O(log n)​

Answer 1

f'f to be in the office and I will