class Solution:
    def findMin(self, nums: List[int]) -> int:
        left, right = 0, len(nums) - 1
        
        while left < right:
            mid = (left + right) // 2
            
            # If the middle element is greater than the rightmost element,
            # the minimum value must be in the right half.
            if nums[mid] > nums[right]:
                left = mid + 1
            
            # Otherwise, the minimum is either at mid or in the left half.
            # We keep 'mid' in the search space.
            else:
                right = mid
                
        # When the loop terminates, left == right, pointing to the minimum.
        return nums[left]