find-minimum-in-rotated-sorted-array.cpp

// Suppose an array sorted in ascending order is rotated at some pivot unknown to you beforehand.
//
// (i.e.,  [0,1,2,4,5,6,7] might become  [4,5,6,7,0,1,2]).
//
// Find the minimum element.
//
// You may assume no duplicate exists in the array.
//
// Example 1:
//
//
// Input: [3,4,5,1,2] 
// Output: 1
//
//
// Example 2:
//
//
// Input: [4,5,6,7,0,1,2]
// Output: 0
//
//


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