二分查找,列表按从小到大的顺序排放,每次寻找中间位置元素的大小进行比较,
时间复杂度:log(n)
def binary_search(li,val):
left =0
right = len(li) - 1
while left <= right:
mid = (left + right) // 2
if li[mid] == val: # 待查找的值等于中间值
return mid
elif li[mid] > val: # 待查找的值在mid左侧
right = mid - 1
else: # li[mid] < val 待查找的值在mid右侧
left = mid + 1
else:
return None
if __name__ == '__main__':
li = [1,3,6,8,10]
val = 8
print(binary_search(li, val))