本文共 568 字，大约阅读时间需要 1 分钟。
def binarySearch( theValues, target ) : # Start with the entire sequence of elements.
low = 0 high = len(theValues) - 1
# Repeatedly subdivide the sequence in half until the target is found.
while low <= high : # Find the midpoint of the sequence.
mid = (high + low) // 2
# Does the midpoint contain the target?
if theValues[mid] == target :return True
# Or does the target precede the midpoint?
elif target < theValues[mid] :high = mid - 1
# Or does it follow the midpoint?
else : low = mid + 1
# If the sequence cannot be subdivided further, we're done.
return False
转载地址：http://kihbi.baihongyu.com/