'''
二分法查找value
前提条件是:lst是个有序列表
'''
def bi_search(lst, x):
begin = 0
end = len(lst) - 1
while begin <= end:
mid = int((end + begin) / 2)
if lst[mid] == x:
return mid
elif lst[mid] < x:
begin = mid + 1
elif lst[mid] > x:
end = mid - 1
return -1
print(bi_search([6, 8, 16, 27, 36], 16))
python版二分法找值
最新推荐文章于 2022-11-14 08:45:00 发布