https://leetcode.com/problems/binary-search/

search.js

function search ( nums , target ) {
    for ( let low = 0 , high = nums.length - 1 , ndx
        ; low <= high
        ; nums[ ndx ] < target ? low = ndx + 1 : high = ndx - 1
        ) if ( ndx = Math.floor( ( high - low ) / 2 ) + low
             , nums[ ndx ] === target
             ) return ndx
    return -1
}