如何使用 JavaScript 实现二分查找算法？

/* 如何使用 JavaScript 实现二分查找算法？ */
function binarySearch(arr, target) {
  var low = 0,
    high = arr.length - 1,
    mid;
  while (low <= high) {
    mid = Math.floor((low + high) / 2);
    if (arr[mid] === target) {
      return mid;
    } else if (arr[mid] < target) {
      low = mid + 1;
    } else {
      high = mid - 1;
    }
  }
  return -1;
}
var arr = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10];
var target = 5;
var result = binarySearch(arr, target);
console.log(result);