def binary_search2(alist, item):
if len(alist) == 0:
return False
else:
mid_point = len(alist)//2
if alist[mid_point] == item:
return True
else:
if item < alist[mid_point]:
return binary_search2(alist[:mid_point], item)
else:
return binary_search2(alist[mid_point+1:], item)
python二分查找
最新推荐文章于 2024-10-03 09:02:12 发布