二分查找

最新推荐文章于 2023-05-28 13:59:52 发布

犹有傲霜枝

最新推荐文章于 2023-05-28 13:59:52 发布

阅读量95

点赞数

本文链接：https://blog.csdn.net/qq_41009742/article/details/108001972

版权

面试紧张没写出来，吐血

lst = [i for i in range(10)]

# 假设查找的数是a
a = 5.5

def search(lst, left, right, a):
    mid = int((right + left) / 2)
    if (lst[mid] == a):
        return mid

    if (left == right): 
        return "cannot find"    

    if (lst[mid] > a):
        return search(lst, left, mid -1,  a)
    elif (lst[mid] < a):
        return search(lst, mid + 1, right, a)

ans_idx = search(lst, 0, 9, a)

print("ans: ", ans_idx)