Run results for: Array reverse-and-pop vs shift, at a range of sizes

Benchmarks the performance of two approaches for emptying an array from the front by sequentially removing each element. The methods are: A - first reversing the array with Array.reverse(), then using Array.pop() to remove each entry B - using Array.shift() to remove each entry

Go to the benchmark

Run details:

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

Browser: Chrome 133

Operating system: Mac OS X 10.15.7

Device Platform: Desktop

Date tested: one year ago

Test name	Executions per second
✓ 100 - reverse and pop	3,568,219 Ops/sec
100 - shift	749,581 Ops/sec
1,000 - reverse and pop	331,909 Ops/sec
10,000 - reverse and pop	33,614 Ops/sec
1,000 - shift	18,645 Ops/sec
100,00 - reverse and pop	3,233 Ops/sec
10,000 - shift	1,736 Ops/sec
100,000 - shift	2 Ops/sec

Test name

Executions per second

✓ 100 - reverse and pop

3,568,219 Ops/sec

100 - shift

749,581 Ops/sec

1,000 - reverse and pop

331,909 Ops/sec

10,000 - reverse and pop

33,614 Ops/sec

1,000 - shift

18,645 Ops/sec

100,00 - reverse and pop

3,233 Ops/sec

10,000 - shift

1,736 Ops/sec

100,000 - shift

2 Ops/sec

Tests:

100 - reverse and pop
let arr = new Array(100) arr.reverse() while(arr.length > 0) { arr.pop() }
100 - shift
let arr = new Array(100) while(arr.length > 0) { arr.shift() }
1,000 - reverse and pop
let arr = new Array(1000) arr.reverse() while(arr.length > 0) { arr.pop() }
1,000 - shift
let arr = new Array(1000) while(arr.length > 0) { arr.shift() }
10,000 - reverse and pop
let arr = new Array(10000) arr.reverse() while(arr.length > 0) { arr.pop() }
10,000 - shift
let arr = new Array(10000) while(arr.length > 0) { arr.shift() }
100,00 - reverse and pop
let arr = new Array(100000) arr.reverse() while(arr.length > 0) { arr.pop() }
100,000 - shift
let arr = new Array(100000) while(arr.length > 0) { arr.shift() }