# LeetCode 153. Find Minimum in Rotated Sorted Array
[153. Find Minimum in Rotated Sorted Array]([leetcode_url](https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/description/)) (<font color=#FFB800>Medium</font> 50.2%)

<!--
(<font color=#00AF9B>Easy</font> 53.8%)
(<font color=#FFB800>Medium</font> 39.6%)
(<font color=#FF375F>Hard</font>)
-->

- 限制 :

> n == nums.length
> 1 <= n <= 5000
> -5000 <= nums[i] <= 5000
> All the integers of nums are unique.
> nums is sorted and rotated between 1 and n times.

- Solution
找 minimun 可以想做找中間值，用這樣的方式去找會比較快。
- 時間複雜度: $O(lgn)$
- 空間複雜度: $O(1)$

- 程式碼

    class Solution {
    public:
        int findMin(vector<int>& nums) {
            int start = 0, end = nums.size() - 1, ans = nums[0];
            while (start <= end) {
                int mid = start + (end - start) / 2;
                if (nums[mid] >= nums[0])
                    start = mid + 1;
                else
                    ans = nums[mid], end = mid - 1; 
            }
            return ans;
        }
    };

</details>