七.二分查找(python)

代码:

def binary(alist,item):
    """二分查找-递归方式"""
    n = len(alist)
    if n > 0:
        mid = n // 2
        if alist[mid] == item:
            return (mid,True)
        elif alist[mid] < item:
            return binary(alist[:mid],item)
        else:
            return binary(alist[mid+1:],item)
    return (-1,False)

def binary2(alist,item):
    """二分查找-非递归"""
    n = len(alist)
    first = 0
    last = n-1
    while first <= last:
        mid = (first+last) // 2
        if alist[mid] == item:
            return (mid,True)
        elif alist[mid] > item:
            last = mid-1
        else:
            first = mid+1
    return (-1,False)





if __name__ == "__main__":
    list = [2,10,15,20,30,100,120,130,150,1000]
    print(binary(list, 100))
    print(binary(list, 101))
    print(binary2(list,100))
    print(binary2(list,101))

打印结果: