153.Find-Minimum-in-Rotated-Sorted-Array.cpp

class Solution {
public:
    int findMin(vector<int>& nums) 
    {
        int i = 0,  j = nums.size()-1;
        if (nums[j]>=nums[i])
            return nums[i];

        while (i<j)
        {
            int k = i+(j-i)/2;
            if (nums[k] >= nums[0])
                i = k+1;
            else
                j = k;
        }
        return nums[i];
    }
};