binarysearch.js

function search(array, searchElement) {
    let low = 0;
    let high = array.length - 1;
    while(low <= high) {
        let mid = Math.floor((low+high) /2);
       	let middleElement =  array[mid];
        if(middleElement == searchElement) {
            return mid;
        } else if(middleElement > searchElement) {
            high = mid -1;
        } else if(middleElement < searchElement) {
            low = mid +1;
        }
    }
    return -1;
}