二分查找算法

二分查找算法实现

def binary_search(list, item):
  # low and high keep track of which part of the list you'll search in.
  low = 0
  high = len(list) - 1

  # While you haven't narrowed it down to one element ...
  while low <= high:
    # ... check the middle element
    mid = (low + high) // 2
    guess = list[mid]
    # Found the item.
    if guess == item:
      return mid
    # The guess was too high.
    if guess > item:
      high = mid - 1
    # The guess was too low.
    else:
      low = mid + 1

  # Item doesn't exist
  return None

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

# 'None' means nil in Python. We use to indicate that the item wasn't found.
print(binary_search(my_list, -1))

输出：
4
None

小结

关键点需要知道：最低索引和最高索引值找中索引的方法：（low+high）//2.