def binary_search(arr, target):
low = 0
high = len(arr) - 1
while low <= high:
mid = (low + high) // 2
if arr[mid] == target:
return mid
elif arr[mid] < target:
low = mid + 1
else:
high = mid - 1
return -1
# 示例使用
arr = [2, 4, 6, 8, 10]
target = 8
result = binary_search(arr, target)
if result != -1:
print("目标元素在索引位置", result)
else:
print("目标元素不在数组中")
Python编写的二分查找程序
于 2023-06-16 20:29:40 首次发布