Binary Search in JavaScript

binarySearch.js

function binarySearch(list, key) {
  let low = 0;
  let high = list.length - 1;

  while (low <= high) {
    let mid = low + Math.floor((high - low) / 2);

    if (key < list[mid]) {
      high = mid - 1;
    } else if (key > list[mid]) {
      low = mid + 1;
    } else {
      return mid;
    }
  }

  return -1;
}