def binary_search(arr, x):
left = 0
right = len(arr)-1
while left <= right:
mid = (left+right) // 2
if arr[mid] > x:
right = mid-1
elif arr[mid] < x:
left = mid+1
else:
return mid
return -1
二分查找
最新推荐文章于 2024-04-23 17:09:00 发布