二分查找：python 實現

def binary_seaech(alist,item):"""二分查找  遞歸實現"""n = len(alist)if n > 0:mid = n // 2if alist[mid] == item:return Trueelif item < alist[mid]:return binary_seaech(alist[:mid],item)else:return binary_seaech(alist[mid+1:],item)return Falsedef binary_find(alist, item):"""二分查找  非遞歸實現"""n = len(alist)first = 0last = n-1while first <= last:mid = (first + last) // 2if alist[mid] == item:return Trueelif item < alist[mid]:last = mid-1else:first = mid + 1return Falseif __name__ == "__main__":li = [17, 21, 3, 4 ,5 ,55, 77 ,93]print(binary_find(li,5))print(binary_find(li,200))

?

總結

以上是生活随笔為你收集整理的python数据结构与算法：二分查找的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網站內容還不錯，歡迎將生活随笔推薦給好友。