BinarySearch如何找到数组中两个邻居之间的值

二分查找算法：寻找数组中两个邻居之间的值

python
def find_neighboring_values(arr, target):
    low, high = 0, len(arr) - 1
    while low <= high:
        mid = (low + high) // 2
        # Check if mid is the target
        if arr[mid] == target:
            return arr[mid]
        # Update the search range based on the comparison
        if arr[mid] < target:
            low = mid + 1
        else:
            high = mid - 1
    # If the target is not found, return the values of neighbors
    if low < len(arr):
        left_neighbor = arr[low - 1] if low > 0 else None
        right_neighbor = arr[low]
        return left_neighbor, right_neighbor
    else:
        return None
# 示例用法
example_array = [1, 3, 5, 7, 9, 11, 13, 15]
target_value = 8
result = find_neighboring_values(example_array, target_value)
print(f"目标值 {target_value} 位于邻居 {result[0]} 和 {result[1]} 之间。")