Toggle navigation
MeasureThat.net
Create a benchmark
Tools
Feedback
FAQ
Register
Log In
sort vs reverse
(version: 0)
Comparing performance of:
sort vs reverse
Created:
2 years ago
by:
Guest
Jump to the latest result
Script Preparation code:
var n = 9998
Tests:
sort
const repeat = Math.sqrt(n); const result = [[], []]; for (let i = 1; i <= repeat; i++) { if(n % i === 0) { result.push(i); if (i !== repeat) result.push(n / i); } } result.sort((a, b) => a - b)
reverse
const repeat = Math.sqrt(n); const result = [[], []]; for (let i = 1; i < repeat; i++) { if(n % i === 0) { result[0].push(i); result[1].push(n / i); } } if (Number.isInteger(repeat)) result[0].push(repeat) result[1].reverse(); result.flat()
Rendered benchmark preparation results:
Suite status:
<idle, ready to run>
Run tests (2)
Previous results
Fork
Test case name
Result
sort
reverse
Fastest:
N/A
Slowest:
N/A
Latest run results:
Run details:
(Test run date:
2 years ago
)
User agent:
Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/121.0.0.0 Safari/537.36
Browser/OS:
Chrome 121 on Windows
View result in a separate tab
Embed
Embed Benchmark Result
Test name
Executions per second
sort
216838.0 Ops/sec
reverse
229184.1 Ops/sec
Related benchmarks:
Sorting speed comparison
pre-sorted sorting
Javascript Sort
Javascript Sort (numbers/strings)
sorting an array and then reverse vs sorting with reversive comparison
Comments
Confirm delete:
Do you really want to delete benchmark?