Find Minimum in rotated Sorted Array

Suppose a sorted array is rotated on 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.

Assume no duplicate exists in the array.

Idea: two points to narrow the range until found.

Note: After rotating in pivot, cases may be (0 1 2 3) ( 3 2 1 0) (2 3 0 1)

So think twice if you code!

classSolution { Public:    intFindmin (vector<int> &num) {        intn =num.size (); returnFind (NUM,0, N-1); }    intFind (vector<int> &num,intAintb) {        intK = (a+b)/2; if(Num[k]>num[b])returnFind (num,k+1, B); Else if(Num[k]<num[a])returnfind (NUM,A,K); Else returnNum[a]; }};

The method of Ps:sort by pivot is to insert a sort. Specific method ~ ~ ~

Find Minimum in rotated Sorted Array