minmaxbinsearch.js

function binarySearch(array, target) {
  let start = 0;
  let end = array.length - 1;
  while (start <= end) {
    let midpoint = Math.floor((start + end) / 2);
    if (target === array[midpoint]) {
      return midpoint;
    }
    if (target > array[midpoint]) {
      start = midpoint + 1;
    }
    if (target < array[midpoint]) {
      end = midpoint - 1;
    }
  }
  return -1;
}