Binary Search

const binarySearch =(arr, target) => {
  let start = 0;
  let end = arr.length - 1;

  while (start <= end) {
    let middleIndex = Math.floor((start + end) / 2);

    if (arr[middleIndex] === target) {
      return middleIndex;
    }

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

;