Question

How to implement the binary search algorithm in JavaScript

Answer 1

function binarySearch(array, element, low, high) {
    while (low <= high) {
        let mid = low + Math.trunc((high - low) / 2);
  
        if (array[mid] == element)
            return mid;
   
        if (array[mid] < element)
            low = mid + 1;
        else
            high = mid - 1;
    }    
    return -1;
}
  
const array = [3, 4, 6, 8, 9, 10, 12, 20, 21, 27, 30, 31, 40, 42];
const number_to_find = 27;
   
const index = binarySearch(array, number_to_find, 0, array.length);
           
if (index == -1) {
    console.log("Not found");
}
else {
    console.log("Found at index: " + index);
}
   

   
   
/*
run:
   
Found at index: 9
   
*/

 

70+ SQL courses for beginners and professionals