def find_min_rotate_recur(array, low, high):
    """
    Finds the minimum element in a sorted array that has been rotated.
    """
    mid = (low + high) // 2
    if mid == low:
        return array[low]
    if array[mid] > array[high]:
        return find_min_rotate_recur(array, mid + 1, high)
    return find_min_rotate_recur(array, low, mid)