二分法查找

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


my_list = [1, 3, 5, 7, 9]
print(binary_search(my_list, 3))
print(binary_search(my_list, 7))
print(binary_search(my_list, 0))