Local minimum of an array. Write a program that, given an array a[] of N distinct integers, finds a local minimum: an entry a[i] that is strictly less than its neighbors. Each internal entry (other than a[0] and a[N-1]) has 2 neighbors. Your program should use ~2 lg N compares in the worst case.
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.