折半查找算法(python)

# -*- coding: UTF-8 -*- import random ''' 折半查找算法 ''' def binarySearch(x, arr, low, high):#迭代算法 while low <= high: mid = (low+high)/2 if x == arr[mid]: break el

>>阅读原文<<