二分查找算法python实现

二分查找算法： 用于在有序数组中快速查找所须要的值，前提是数组已经排序 python代码实现：python def binary_search(thelist, item): low = 0 high = len(thelist) - 1 while low <= high: mid = int((low + high) / 2) if thelist[mid] == item:

>>阅读原文<<