Run results for: Different method to traverse a reversed array.

Run details:

User agent: Mozilla/5.0 (Windows NT 10.0; Win64; x64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/132.0.0.0 Safari/537.36 Edg/132.0.0.0

Browser: Chrome 132

Operating system: Windows

Device Platform: Desktop

Date tested: one year ago

reduceRight

112K/s

for loop

90K/s

for of with reverse

74K/s

for of with toReversed

67K/s

reduceRight with add operation

52K/s

forEach with reverse

50K/s

forEach with toReversed

48K/s

View exact numbers

Test name	Executions per second
✓ reduceRight	111,827 Ops/sec
for loop	89,872 Ops/sec
for of with reverse	74,185 Ops/sec
for of with toReversed	67,184 Ops/sec
reduceRight with add operation	52,166 Ops/sec
forEach with reverse	49,967 Ops/sec
forEach with toReversed	48,362 Ops/sec

Script Preparation code:

const array = Array(10000).fill(0).map((_, i) => i);

Tests:

for loop
let sum = 0; for (let i = array.length - 1; i >= 0; i--) { sum += array[i]; }
for of with reverse
let sum = 0; for (const v of [...array].reverse()) { sum += v; }
for of with toReversed
let sum = 0; for (const v of array.toReversed()) { sum += v; }
reduceRight
const sum = array.reduceRight((prev, curr) => prev + curr, 0);
reduceRight with add operation
let sum = 0; array.reduceRight((_, curr) => { sum += curr; })
forEach with reverse
let sum = 0; [...array].reverse().forEach(v => { sum += v; });
forEach with toReversed
let sum = 0; array.toReversed().forEach(v => { sum += v; });