二分查找仅当列表是有序的时候,才管用!!!记住了!
运行时间是log n 是log以2为底n的对数,而且对数是幂运算的逆运算!
大O表示法:不是指时间,而是操作数!指的是算法运行的增速!下面是各种比较!
代码实现二分查找:
def binary_search(list,item):
low = 0
high = len(list) - 1
while low <= high:
mid = int((low + high)/2)
guess = 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,5)) #2
print(binary_search(my_list,-1)) #None