时间复杂度:O(logn)
#二分查找前提条件:数组已经有序
def binary_search(arr, target):
low = 0
high = len(arr)-1
while low <= high:
mid = low + (high - low) // 2
if arr[mid] > target:
high = mid - 1
elif arr[mid] < target:
low = mid + 1
else:
return True
return -1
arr = [12, 15, 23, 25, 27, 32, 45, 50]
print(binary_search(arr, 25))