Find Minimum in Rotated Sorted Array

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