Find Minimum in Rotated Sorted Array

 https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/

 

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