Recursive implementation of binary search

binary-search.js

const input1 = [-1, 0, 1, 2, 3, 4, 7, 9, 10, 20];
//               0  1  2  3  4  5  6  7  8   9

const binarySearch = (array, left, right, target) => {
    if (left > right)
        return -1;
    
    const mid = Math.floor((left + right) / 2);

    if (target === array[mid])
        return mid;
    
    if (target > array[mid])
        return binarySearch(array, mid + 1, right, target);

    return binarySearch(array, left, mid - 1, target);
}

console.log(binarySearch(input1, 0, input1.length - 1, 7));
console.log(binarySearch(input1, 0, input1.length - 1, 10));