def binarySearch(list, item):
if len(list) < 0:
return
high = len(list) - 1
low = 0
min = int((low + high)/2)
while(min <= high):
if(list[min] == item):
return min
elif(list[min] < item):
min += 1
else:
high -= 1
return None
if __name__ == "__main__":
# 创建一个list
list = [0, 3, 4, 5, 7, 12, 23, 89]
print(binarySearch(list, 100))