❗️Что будет на выходе?

function recursiveBinarySearch(arr, target, start = 0, end = arr.length - 1) {
  if (start > end) {
    return -1;
  }

  const mid = Math.floor((start + end) / 2);

  if (arr[mid] === target) {
    return mid;
  } else if (arr[mid] < target) {
    return recursiveBinarySearch(arr, target, mid + 1, end);
  } else {
    return recursiveBinarySearch(arr, target, start, mid - 1);
  }
}

const result = recursiveBinarySearch([[[1, 2, 3, 4, 5, [6, 7], 8], 9], 6]);

console.log(result);

Ответ: -1

JavaScript test | #JavaScript