{
const array = [1, 1, 5, 124, 400, 1004, 2897, 9878];
function binarySearch(array, val, left = 0, right = array.length - 1) {
let mid = Math.floor((left + right) / 2);
if (left > right) return -1;
if (val === array[mid]) return mid;
else if (val < array[mid]) return binarySearch(array, val, left, mid - 1);
else return binarySearch(array, val, mid + 1, right);
}
return binarySearch(array, 2897);
}