Find a Local Maximum Using Binary Search
A local maximum is an element greater than both its neighbors.
arr[mid] > arr[mid-1] && arr[mid] > arr[mid+1]:
Found a peak!
arr[mid] < arr[mid+1]: Peak is to the RIGHT
(ascending slope)
arr[mid] < arr[mid-1]: Peak is to the LEFT
(descending slope)