二分查找 python实现

二分查找的python实现，经典的面试题，啥也很少说，直接上代码python def binary_search(num,list): low = 0 high = len(list) - 1 while(low <= high): middle = (low + high) / 2 if list[middle] > num:

>>阅读原文<<