Python二分法查找【图解】【代码】

「已注销」

于 2022-01-26 14:56:45 发布

阅读量558

点赞数

分类专栏： Python数据结构与算法文章标签：数据结构 python

本文链接：https://blog.youkuaiyun.com/qq_41423247/article/details/122702130

版权

Python数据结构与算法专栏收录该内容

7 篇文章

订阅专栏

def binary_search(data,target,low,high):
    # low和high是下标
    # num用来统计运行了多少次
    global num

    if(low > high):
        print("low值大于high值，错误")
        return False
    else:
        # //整除
        mid = (low+high)//2
        if target == data[mid]:
            num = num + 1
            return mid
        elif target > data[mid]:
            num = num + 1
            return binary_search(data,target,mid+1,high)
        elif target < data[mid]:
            num = num + 1
            return binary_search(data,target,low,mid-1)


li = [0,1,2,3,4,5,6,7,8,9]
num = 0
print(binary_search(li,9,0,9))
print(num)