python 排序算法之 二分查找

def binary_search(find, L) : low = 0 high = len(L) while low < high : mid = int((low + high) / 2) if L[mid] == find : return mid #左半邊 elif L[mid] > find : high = mid

>>阅读原文<<