deflinear_search(list, value):for i, v inenumerate(list):if v == value:return i
returnNone# testlist=[1,2,3,4]
index = linear_search(list,3)print(index)
defbinary_search(list, value):
left =0
right =len(list)-1while left <= right:
mid =(left + right)//2iflist[mid]== value:return mid
eliflist[mid]> value:
right = mid -1else:
left = mid +1returnNone# testlist=[i for i inrange(1,10)]
index = binary_search(list,8)print(index)
文章目录列表查找顺序查找二分查找列表查找输入:列表、待查找元素输出:元素下标列表内置查找函数:index()时间复杂度:O(n)顺序查找(线性查找)从列表第一个元素开始,顺序进行搜索def linear_search(list, value): for i, v in enumerate(list): if v == value: return i return None# testlist = [1, 2, 3, 4]i