Поиск в сломанном массиве

def binary_search(array, target, left=0, right=None):
    if right is None:
        right = len(array) - 1
    if not array:
        return -1
    mid = (left + right + 1) // 2
    if array[mid] == target:
        return mid
    if left == right:
        return -1
    if array[0] < array[mid]:
        if target >= array[0]:
            if target > array[mid]:
                return binary_search(array, target, mid, right)
            return binary_search(array, target, left, mid - 1)
        return binary_search(array, target, mid, right)
    if target < array[0]:
        if target < array[mid]:
            return binary_search(array, target, left, mid - 1)
        return binary_search(array, target, mid, right)
    return binary_search(array, target, left, mid - 1)
 
 
def broken_search(array, target):
    return binary_search(array, target, 0, len(array) - 1)

def broken_search(array, target):
    start_target = array[0]
    right = 0
    left = len(array) - 1
    while right <= left:
        middle = right + (left-right) // 2
        if target == array[middle]:
            return middle
        if (array[middle] < start_target) is not (target < start_target) or array[middle] > target:
            left = middle - 1
        else:
            right = middle + 1
    return -1