search.js

var Benchmark = require('benchmark');
var expect = require('expect');
var suite = new Benchmark.Suite;

var test = [];

for (var s = 0; s < 1000000; s++) {
    test.push(s);
}

suite
    .add('binary search', () => binarySearch(test, 689123))
    .add('normal search', () => normalSearch(test, 689123))
    .on('cycle', event => console.log(String(event.target)))
    .on('complete', function() {console.log('Fastest is ' + this.filter('fastest').map('name'))})
    .run({ 'async': true });

function binarySearch(arr, value) {
    var start = 0;
    var end = arr.length - 1;
    var point;

    while(start <= end) {
        point = (end + start) >> 1;

        if (arr[point] === value) {
            return arr[point];
        }

        if (arr[point] > value) {
            end = point - 1;
        } else if (arr[point] < value) {
            start = point + 1;
        }
    }
}

function normalSearch(arr, value) {
    return arr.find(item => item === value);
}