??二分算法的定義不在多說了，百度一下就知道(支持國產(chǎn) ) import syssource = [1,2,3,4,5,6,7,8,9,10] #must be in orderdes = int(sys.argv[1])low = 0high = len(source) - 1targetIndex = -1print "des=",deswhile low = high: middle = (low + high)/2

??二分算法的定義不在多說了，百度一下就知道(支持國產(chǎn)

)

import sys

source = [1,2,3,4,5,6,7,8,9,10] #must be in order

des = int(sys.argv[1])

low = 0

high = len(source) - 1

targetIndex = -1

print "des=",des

while low <= high:

middle = (low + high)/2

if des == source[middle]:

targetIndex = middle

break

elif des < source[middle]:

high = middle -1

print "middle element[index=",middle,",value=",source[middle],"] is bigger than des, continue search from[",low,"to",high,"]"

else:

low = middle + 1

print "middle element[index=",middle,",value=",source[middle],"] is smaller than des, continue search from[",low,"to",high,"]"

print "search complete, target element's index in source list is ",targetIndex

?運行結(jié)果如下：

大小: 5.2 KB

查看圖片附件

總結(jié)

以上是生活随笔為你收集整理的python实现二分查找算法_python实现二分查找算法的全部內(nèi)容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內(nèi)容還不錯，歡迎將生活随笔推薦給好友。