!Algorithms

Binary search

binarySearch

// const list = [1, 3, 4, 5, 7, 10];

function binarySearch(list, element) {
		// code
     let first = 0;
    let last = list.length - 1;
    let position = -1;
    let found = false;
    let middle;
 
    while (found === false && first <= last) {
        middle = Math.floor((first + last)/2);
        if (list[middle] == element) {
            found = true;
            position = middle;
        } else if (list[middle] > element) {
            last = middle - 1;
        } else {
            first = middle + 1;
        }
    }
    return position;
}