Pyhon二分法实现

def binary_search(list, item):
    low = 0                #low 和 high 用于跟踪要在其中查找的部分列表
    high = len(list) - 1
    while low <= high:
        mid = (low + high) // 2
        guessNum = list[mid]
        if guessNum == item:
            return mid        #目标元素的位置
        if guessNum > item:           #猜的大了
            high = mid - 1
        else:        #猜的小了
            low = mid + 1
    return  None

my_list = [2, 4, 5, 6, 7, 8]
print(binary_search(my_list, 9))