1 def binary_search(number, array=[]):
 2     """ binary search. """
 3     low = 0
 4     high = len(array) - 1
 5     while low <= high:
 6         mid = (low + high) // 2
 7         guess = array[mid]
 8         if guess == number:
 9             return mid
10         elif guess < number:
11             low = mid + 1
12         else: #guess > number
13             high = mid - 1
14     return None

二分查找法 O(logn)

相关文章:

  • 2022-12-23
  • 2022-12-23
  • 2022-12-23
  • 2021-04-18
  • 2021-08-14
  • 2021-07-22
  • 2021-05-22
  • 2022-12-23
猜你喜欢
  • 2021-05-21
  • 2021-06-12
相关资源
相似解决方案