用Python写一个二分查找

二分查找是一种在有序列表中查找某一特定元素的搜索算法。下面是一个 Python 代码示例：

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
        elif guess > item:
            high = mid