二元搜索(python)
最近在学习Python中。貌似很久都没写个日志了,刚看到二元搜索,就往上面写写吧
def search(seqneuce,number,lower,upper):
if lower == upper:
assert number == seqneuce[upper]
print upper
return upper;
else:
middle = (lower + upper) // 2
if number > seqneuce[middle]:
return search(seqneuce,number,middle+1,upper)
else:
return search(seqneuce,number,lower,middle)
seq=[12,232,43,54,57,879,32,43]
seq.sort()
print seq
search(seq,43,0,8)
浙公网安备 33010602011771号