No target, no need for the whole array to be sorted — just follow the slope. Compare
nums[mid] to its right neighbor: if it's still climbing, a peak is guaranteed
somewhere ahead (imagine the array bounded by -∞ on both edges — an ascending run
can't just fall off the end). If it's flat or descending, the peak is at mid or
to its left.