二分查找
def midFind(arr,target):
# 二分查找
# [2,3,4,5,6]
low,high=0,len(arr)-1
while low<high:
mid=(low+high)//2
if arr[mid]>target:
high=mid-1
elif arr[mid]<target:
low=mid+1
else:
return mid
return False
arr=[2,3,4,5,6]
target=11
print(midFind(arr,target))
arrV=[5,6,2,3,4]