def erfenSearch(arr, k):
low = 0
high = len(arr) - 1
while low <= high:
mid = (low + high) // 2 #得到中间值
if arr[mid] == k:
return mid # 找到元素,返回索引
elif arr[mid] > k:
low = mid + 1 # 调整搜索范围
else:
high = mid - 1 # 调整搜索范围
return -1 # 未找到元素
# 主函数
def main():
arr1 = [85, 63, 52, 34, 25, 17, 6]
num = 61
result1 = erfenSearch(arr1, num)
if result1 != -1:
print(f"元素 {num} 存在于索引 {result1}.")
else:
print(f"元素 {num} 不存在于数组中.")
if __name__ == "__main__":
main()