LC0153.cpp

/*
Problem Statement: https://leetcode.com/problems/find-minimum-in-rotated-sorted-array/
Time: O(log n)
Space: O(1)
Author: Mohammed Shoaib, github.com/Mohammed-Shoaib
*/

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