':type nums: List[int]
:rtype: int'

def findMin(self, nums):

    (left, right) = (0, (len(nums) - 1))
    while ((left < right) and (nums[left] >= nums[right])):
        mid = (left + ((right - left) / 2))
        if (nums[mid] < nums[left]):
            right = mid
        else:
            left = (mid + 1)
    return nums[left]
