# Find Minimum in Rotated Sorted [[array|Array]]
We can see the pattern of [[binary-search]] here.
```python
left, right = 0, len(nums) - 1
while left < right:
mid = left + (right - left) // 2
if nums[mid] < nums[right]:
right = mid
else:
left = mid + 1
return nums[left]
```