Find a local minimum in an array
Return the index of any element smaller than its neighbours (the ends compare with their one neighbour). A linear scan works; the follow-up is logarithmic time by binary searching toward the smaller neighbour.
No answer yet. Write the first one; the best answer gets endorsed.

