Binary Search - Javascript

binarySearch.js

const binarySearch = (arr, val) => {
    let min = 0
    let max = arr.length - 1
    while(min <= max ) {
        const mid = Math.floor((min+max)/2)
        if(arr[mid] === val) {
            return mid
        } else if(arr[mid] < val) {
            min = mid + 1
        } else {
            max = mid - 1
        }
    }
    return -1
}

usage.js

const genRandArr = (num) => Array.from({length: num}, () => Math.floor(Math.random() * 10))
const n = 1000
const arr = genRandArr(n)
const s = 12

console.log(binarySearch(arr, s))