Binary Search with Recursion

binarySearch.js

let moves = 0;

const findItem = (arr, target) => {
  if (!Array.isArray(arr)) return arr;
  moves++;
  const midIndex = Math.floor(arr.length / 2);
  const midValue = arr[midIndex];

  if (target === midValue) {
    return midValue;
  } else if (midValue > target) {
    const leftHalf = arr.slice(0, midIndex); 
    return findItem(leftHalf, target);
  } else if (midValue < target) {
    const rightHalf = arr.slice((midIndex + 1), arr.length);
    return findItem(rightHalf, target);
  }
};

const input = [1, 2, 3, 4, 5, 6, 19, 20, 100, 115, 190];
const myIndex = findItem(input, 115);