妙趣横生的python 算法 之 折半查找
之前的代码写的比较匆忙，真实不好意思啊，见笑了，代码已经更正
# -*- coding:utf8 -*-import osimport sysimport mathdef halfSearch(arr=,find = 1): ''' 折半查找，2分查找 折半查找的前提是数据是有序的 算法：mid = Math.floor(low+hight/2) ''' mid = 0 low = 0 high = len(arr) - 1 while(low<=high): print low,high mid = (low + high)/2 print mid if(arr==find): print "find %s index is %s",(find,mid) return else: if(find > arr): low = mid + 1 else: high = mid - 1 print "Not Find" return None #运行脚本if __name__ =="__main__": halfSearch()
页:
[1]