# Find Minimum in Rotated Sorted Array

```cpp
# written by Ashir
class Solution:
    def findMin(self, nums: List[int]) -> int:
        m = nums[0]
        mid = 0

        if len(nums) == 1:
            return nums[0]
        for i in range(len(nums) - 1):
            if nums[i + 1] < nums[i]:
                return nums[i + 1]
            if(nums[0] == min(nums)):
                return nums[0]
        
        
        # while(l <= r):
        #     if mid ==
        // O(log n)
```