python 二分查找

前提：有序序列

代码：

def binary_search(alist,item):
    '''递归法'''
    n=len(alist)
    if n>0:
        mid=n//2
        if alist[mid]==item:
            return True
        elif alist[mid]>item:
            return binary_search(alist[:mid],item)
        else:
            return binary_search(alist[mid+1:],item)
    return False

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