Binary Search Recursive

binarySearchRecursive.js

function searchRecursive(inputArray, searchTerm, left, right) {
  if (left > right) {
    return false;
  }

  const midPoint = Math.floor((left + right) / 2);

  if (inputArray[midPoint] === searchTerm) {
    return true;
  } else if (searchTerm < inputArray[midPoint]) {
    return searchRecursive(inputArray, searchTerm, left, midPoint - 1);
  } else {
    return searchRecursive(inputArray, searchTerm, midPoint + 1, right);
  }
}

function binarySearch(inputArray, searchTerm) {
  return searchRecursive(inputArray, searchTerm, 0, inputArray.length - 1)
}