m0_47192318的博客

原创 算法图解笔记--二分查找

算法图解笔记–第一章二分查找（仅当列表有序）def binary_search(list, item)： low = 0 high = len(list) - 1 while low <= high: mid = (low + high) / 2 guess = list[mid] if guess == item: return mid if guess > item: high = mid - 1#不进行-1的话在目