def b_search(n,lst):
start = 0
end = len(lst) - 1
while start < end:
middle = (start + end) // 2
if n > lst[middle]:
start = middle + 1
elif n < lst[middle]:
end = middle - 1
else:
return lst[middle]
return False
print(b_search(100,[
二分法、最大公约数
最新推荐文章于 2020-06-05 13:45:44 发布