Find Minimum in Rotated Sorted Array.2.2.cpp

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