二分查找算法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:

>>阅读原文<<