Think about using binary search and mergesort, or devising your own divide-and-conquer algorithm. Implement and test your algorithm.
Local minimum in an array. Given an array of n real numbers, design a logarithmic-time algorithm to identify a local minimum (an index i such that both a [i] < a [i−1] and a[i] < a[i+1].
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.