Find Minimum in Rotated Sorted Array

Write `find_min(nums)` returning the smallest value in an ascending array that has been rotated an unknown number of times. All values are distinct. find_min([3, 4, 5, 1, 2]) -> 1 find_min([1, 2, 3]) -> 1 Comparing the midpoint against the *left* end cannot distinguish a rotated array from an unrotated one. Comparing against the right end can: if `nums[mid] > nums[right]` the minimum is strictly right of mid, otherwise mid is still a candidate. That asymmetry is the whole question.