Binary Search

searching.js

// ES6 Arrow Function
// Iterative Binary Search
const binarySearch = (arr, x) => {   
    let start = 0;
    let end = arr.length - 1;
    let mid;
    while (start <= end) {
        mid = Math.floor((start + end) / 2);
        if (arr[mid] === x) return mid;
  
        if (arr[mid] < x) {
            start = mid + 1;
        } else {
            end = mid - 1;
        }
    }

    return -1;
}

// let testArray = [1, 2, 3, 4, 5, 6, 7, 8];
// let x = 8;
// binarySearch(testArray, x);
// output => 7