Python3&数据结构之二分查找

#实现一个二分查找
#输入：一个有序数组和要找的元素
#输出：待查找的元素的位置

def binary_search(list,item):
    low = 0
    high = len(list) - 1
    while low <= high:
        mid = (low + high) // 2
        guess = list[mid]
        if guess == item:
            return mid
        if guess < mid:
            high = mid - 1
        else:
            low = mid + 1
    return None

if __name__ == '__main__':
    test = [0, 1, 2, 8, 13, 17, 19, 32, 42]
    print(binary_search(test,13))

时间复杂度O(logn)