Question

How to implement binary search on array in JavaScript

Answer 1

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


let array = [1, 2, 3, 4, 5, 6, 7, 8, 9, 10, 11];

console.log("index = " + binarySearch(array, 8));




/*
run:

index = 7

*/

 

70+ SQL courses for beginners and professionals