Python数据结构：二分查找

时间复杂度：O(log以2为底n)
代码示例

def binary_serch(l,val):
    left = 0
    right = len(l)-1
    while left <= right:
        mid = (left + right) // 2
        if l[mid] == val:
            return mid
        elif l[mid] > val:
            right = mid -1
        else:
            left = mid +1
    else:
        return None

测试

l = [1,2,3,4,5,6,7,8,9,10]
val = 10
binary_serch(l,val)

输出

9

非常纠结边界条件,这块不好处理。

left<=right

https://blog.csdn.net/qq_45978890/article/details/116094046?ops_request_misc=%257B%2522request%255Fid%2522%253A%2522163231621316780255278464%2522%252C%2522scm%2522%253A%252220140713.130102334..%2522%257D&request_id=163231621316780255278464&biz_id=0&utm_medium=distribute.pc_search_result.none-task-blog-2~all~top_positive~default-1-116094046.pc_search_result_control_group&utm_term=%E4%BA%8C%E5%88%86%E6%9F%A5%E6%89%BE&spm=1018.2226.3001.4187

这是一种解释，开始的时候定边界。。。差不多理解了

https://zhuanlan.zhihu.com/p/84846136?utm_source=wechat_session&utm_medium=social&utm_oi=853631482021961728