Leetcode:Find Minimum in Rotated Sorted Array

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

You may assume no duplicate exists in the array.

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