二分查找的兩種實現方式(遞歸和非遞歸)--python實現

二分查找是我第一次面試時的編程題。python 非遞歸方式：面試 # 二分查找非遞歸實現 def binary_search(list, item): low = 0 high = len(list) - 1 while low <= high: mid = (low + high)//2 guess = list[mid] if guess == item : retu

>>阅读原文<<