Run results for: For-I vs For-of vs Reduce: Find the largest value in an array

A few of these cases are mostly to figure out how some changes impact optimisation. At the time of writing, each new test is based on the previous fastest test. So failed ideas don't reappear.

Run details:

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

Browser: Chrome 123

Operating system: Mac OS X 10.15.7

Device Platform: Desktop

Date tested: 7 months ago

Test name	Executions per second
for-i: classic	320972.5 Ops/sec
for-i: Math.max	168710.8 Ops/sec
for-i: Ternary	320581.2 Ops/sec
for-i: cache length	604623.6 Ops/sec
for-i: cache value	637197.1 Ops/sec
for-of	14018776.0 Ops/sec
reduce	19365584.0 Ops/sec

Script Preparation code:

// 50 random numbers from 0 to 1000
var data = [814,7,692,190,260,448,574,459,724,886,128,831,488,55,234,38,566,870,280,374,304,532,585,235,989,307,853,245,332,219,38,377,344,898,587,769,231,865,12,939,551,827,21,117,205,767,1,790,355,855];

Tests:

for-i: classic
let largest = -1; for (let i = 0; i < data.length; ++i) { if (data[i] > largest) { largest = data[i]; } }
for-i: Math.max
let largest = -1; for (let i = 0; i < data.length; ++i) { largest = Math.max(data[i], largest); }
for-i: Ternary
let largest = -1; for (let i = 0; i < data.length; ++i) { largest = data[i] > largest ? data[i] : largest; }
for-i: cache length
let largest = -1; const length = data.length; for (let i = 0; i < length; ++i) { largest = data[i] > largest ? data[i] : largest; }
for-i: cache value
let largest = -1; const length = data.length; for (let i = 0; i < length; ++i) { const item = data[i]; largest = item > largest ? item : largest; }
for-of
let largest = -1; for (const item of data) { largest = item > largest ? item : largest; }
reduce
const largest = data.reduce((largest, item) => item > largest ? item : largest);

Run results for: For-I vs For-of vs Reduce: Find the largest value in an array

A few of these cases are mostly to figure out how some changes impact optimisation. At the time of writing, each new test is based on the previous fastest test. So failed ideas don't reappear.

for-i: classic

for-i: Math.max

for-i: Ternary

for-i: cache length

for-i: cache value

for-of

reduce