Python 二分法查找

def BinarySearch(keyTime,List):
low = 0
high = len(List) - 1
middle = 0

while(low <= high):
middle = int((low + high) / 2)
#获取中间数据
listTime = List[middle][0]
if listTime == keyTime:
return listTime
break
elif listTime < keyTime:
low = middle + 1
elif listTime > keyTime:
high = middle - 1

if high < 0:
print '不在List范围内'
return 0
elif low > len(List) - 1:
print '超出List范围'
return len(List)
else:
return (high,low)