python中二分查找

二分查找也称折半查找，它的效率较高。但是二分查找要求线性表必须采用顺序储存结构，而且表中元素按关键字有序排列。

写二分查找时有两个方法，一个是用递归，一个不用递归。

用递归的方法如下

#coding:utf-8

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


if __name__ == "__main__":

    li = [17, 20, 26, 31, 44, 54, 55, 77, 93]
    print(binary_search(li,55))
    print(binary_search(li,521))

不用递归的方法写法如下

#coding:utf-8

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:
            first = mid+1
        else:
            last = mid-1
    return False

if __name__ == "__main__":

    li = [17, 20, 26, 31, 44, 54, 55, 77, 93]
    print(binary_search_2(li, 55))
    print(binary_search_2(li, 521))    

二分查找的最优时间复杂度是O(1)

最坏时间复杂度是O(logn)