Benchmark: findIndex vs IndexOf + map vs binary search

HTML Preparation code:

<script>
    function binarySearch(lst, x) {
        var left = 0;
        var right = lst.length - 1;
        while (left <= right) {
            var mid = Math.floor((left + right) / 2);
            if (lst[mid] === x) {
                return mid;
            }
            if (lst[mid] < x) {
                left = mid + 1;
            } else {
                right = mid - 1;
            }
        }
        return -1;
    }
</script>

Script Preparation code:

var arr = new Array(15000);
arr.fill({
    id: 0
});
arr = arr.map((el, idx) => el.id = idx);
var foo = Math.floor(Math.random() * 15000);

Tests:

findIndex
arr.findIndex(x => x.id ===foo );
Map + IndexOf
arr.map(x => x.id).indexOf(foo);
Binary search
binarySearch(arr,foo)

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
findIndex
Map + IndexOf
Binary search

Fastest: N/A

Slowest: N/A

Latest run results:

Run details: (Test run date: 6 months ago)

User agent: Mozilla/5.0 (Macintosh; Intel Mac OS X 10_15_7) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/140.0.0.0 Safari/537.36

Browser/OS: Chrome 140 on Mac OS X 10.15.7

View result in a separate tab

Test name	Executions per second
findIndex	27174.5 Ops/sec
Map + IndexOf	11858.3 Ops/sec
Binary search	19531486.0 Ops/sec

Related benchmarks:

findIndex vs IndexOf + map vs binary search (version: 1)

Comparing performance of: findIndex vs Map + IndexOf vs Binary search

Created: 9 months ago by: Guest

Jump to the latest result

findIndex

Map + IndexOf

Binary search

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A