Run results for: Step through array in reverse order - reduceRight vs reverse

Run details:

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

Browser: Chrome 124

Operating system: Mac OS X 10.15.7

Device Platform: Desktop

Date tested: 2 years ago

Benchmark engine: Benchmark.js

reduceRight 50

13.7M/s

slice and reverse 50

9.2M/s

reduceRight 150

6.8M/s

slice and reverse 150

4.3M/s

reduceRight 500

2.8M/s

slice and reverse 500

1.6M/s

View exact numbers

Test name	Executions per second
✓ reduceRight 50	13,697,965 Ops/sec
slice and reverse 50	9,229,443 Ops/sec
reduceRight 150	6,833,463 Ops/sec
slice and reverse 150	4,313,971 Ops/sec
reduceRight 500	2,824,343 Ops/sec
slice and reverse 500	1,591,518 Ops/sec

Script Preparation code:

var nums50 = Array.from({length:  50}, () => Math.random() * 100 |0)
var nums150 = Array.from({length: 150}, () => Math.random() * 100 |0)
var nums500 = Array.from({length: 500}, () => Math.random() * 100 |0)

Tests:

slice and reverse 50
nums50.slice().reverse().forEach(n => n**2)
reduceRight 50
nums50.reduceRight((_,n) => n**2, null)
slice and reverse 150
nums150.slice().reverse().forEach(n => n**2)
reduceRight 150
nums150.reduceRight((_,n) => n**2, null)
slice and reverse 500
nums500.slice().reverse().forEach(n => n**2)
reduceRight 500
nums500.reduceRight((_,n) => n**2, null)