第一章 二分查找 def binary_search(mylist, item): low = 0 high = len(mylist) - 1 while low <= high: mid = (low + high) // 2 guess = mylist[mid] if( guess == item ): return mid if( guess < item): low = mid + 1 else: high = mid - 1 return None 大O表示法 一些常见的大O运行时间: 小结: