fierce

#!/usr/bin/python
def binary_search(list, item):
  low = 0
  high = len(list)-1
  while low <= high:
    mid = (low + high)/2
    print(mid)
    guess = list[mid]
    if guess == item:
      return mid
    elif guess > item:
      high = mid - 1
    else:
      low = mid+1
  return None
mylist = [1,3,5,7,9]
print binary_search(mylist,3)
print binary_search(mylist,-1)

分类:

技术点:

相关文章:

  • 2021-12-10
  • 2021-05-10
  • 2021-06-26
  • 2022-12-23
  • 2022-12-23
  • 2021-12-10
  • 2021-12-10
  • 2021-12-10
猜你喜欢
  • 2021-07-24
  • 2021-12-10
  • 2021-12-10
  • 2021-12-10
  • 2021-12-10
相关资源
相似解决方案