A simple binary search implementation

binary-search.js

function binarySearch(id, array) {
  const mid = Math.floor(array.length / 2);

  if (array[mid].id === id) {
    return array[mid];
  } else if (array[mid].id < id) {
    return binarySearch(id, array.slice(mid));
  } else {
    return binarySearch(id, array.slice(0, mid));
  }
}