我在数组中的二进制搜索算法中的While条件

function binarySearch(arr, target) {
    let low = 0;
    let high = arr.length - 1;

    while (low <= high) {
        let mid = Math.floor((low + high) / 2);
        if (arr[mid] === target) {
            return mid; // 找到目标，返回索引
        } else if (arr[mid] < target) {
            low = mid + 1; // 目标在右侧子数组
        } else {
            high = mid - 1; // 目标在左侧子数组
        }
    }
    return -1; // 未找到目标
}

// 使用示例
const sortedArray = [1, 2, 3, 4, 5, 6, 7, 8, 9];
const targetValue = 5;
const index = binarySearch(sortedArray, targetValue);
console.log(`The index of ${targetValue} is ${index}`); // 输出索引