Benchmark: Javascript Array sorting performance with sort() and reduce()

HTML Preparation code:

<div id='min-data'></div>

Tests:

with reduce()
const div = document.getElementById('min-data'); const newArray = []; for(let i = 0; i < 100000; i++){ const num = Math.floor(Math.random() * 100000); newArray.push(num); } newArray.reduce((a, b) => (a < b ? a : b), []); div.innerHTML = newArray[0].toString();
with sort()
const div = document.getElementById('min-data'); const newArray = []; for(let i = 0; i < 100000; i++){ const num = Math.floor(Math.random() * 100000); newArray.push(num); } newArray.sort((a, b) => a - b); div.innerHTML = newArray[0].toString();

Rendered benchmark preparation results:

Previous results

Test case name	Result
with reduce()
with sort()

ⓘ Get performance results from real users on your website with Request Metrics.

Latest run results:

Run details: (Test run date: 2 days ago)

User agent: Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/123.0.0.0 Safari/537.36

Browser/OS: Chrome 123 on Linux

Test name	Executions per second
with reduce()	54.9 Ops/sec
with sort()	29.9 Ops/sec

Javascript Array sorting performance with sort() and reduce() (version: 0)