二分法Python实现

# 二分法查找要求：查找序列必须是有序序列
# 查找156在lst中的位置
lst = [1, 4, 5, 6, 8, 9, 11, 15, 17, 18, 19, 45, 49, 98, 101, 156, 178, 199]
left = 0
right = len(lst)-1
n = 156
while left <= right:
    middle = (left + right) // 2
    if n < lst[middle]:
        right = middle - 1
    elif n > lst[middle]:
        left = middle + 1
    else:
        print(middle)
        break
else:
    print("没有这个数")


# 递归法
def binary_search(lst, n, left, right):
    if left > right:
        print("没有这个数")
        return -1
    middle = (left + right) // 2
    if n < lst[middle]:
        right = middle - 1
    elif n > lst[middle]:
        left = middle + 1
    else:
        return middle
    return binary_search(lst, n, left, right)
left = 0
right = len(lst) - 1
print(binary_search(lst, 156, left, right))