Recursive Binary Search O(log n) JS

TheTechnoCult

·

Follow

Oct 8, 2023

--

Listen

Share

function recursiveBinarySearch(arr, n) {
  let mid = Math.floor(arr.length / 2)

  if (arr.length === 1 && arr[0] != n) {
    return null
  }
  if (n === arr[mid]) {
    return mid
  } else if (n < arr[mid]) {
    return recursiveBinarySearch(arr.slice(0, mid), n)
  } else if (n > arr[mid]) {
    return recursiveBinarySearch(arr.slice(mid), n)
  }
}

const names = ["Elida Sleight", "Francina Vigneault", "Lucie Hansman", "Nancie Rubalcaba"];

const index = recursiveBinarySearch(names, "Lucie Hansman");
console.log(index);