Simple Binary Search in JS

BinarySearch.js

function binarySearch(elm, set) {
    let i = 0
    let j = set.length - 1

    while (i < j) {
        const m = Math.floor((j + i) / 2);
        
        if (elm > set[m])
            i = m + 1
        else
            j = m
    }

    if (elm == set[i]) 
        return i

    return -1
}

// const set = [3, 4, 5, 6, 7, 8, 9, 10]
// console.log(binary(9, set))