Find Minimum in Rotated Sorted Array — binary search
The rotation point is where the values drop. Any element that is ≤ the last element sits in the "wrapped" lower part — search left of it to find the very first such element, the minimum.
Try: