二分查找

# 二分查找(折半查找)的前提:必须有序
def find(l,a):
    n=len(l)
    start=0
    end=n-1
    while start<=end:
        mid=(start+end)//2
        if a==l[mid]:
            return mid
        elif a>l[mid]:
            start=mid+1
        else:
            end=mid-1
    return -1
l=[1,2,3,4,5,6,9]
r=find(l,1)
print(r)