Benchmark: sort() vs reverse() when getting last item or first item

Tests:

first item after reverse

array.forEach(n => {
  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().reverse()[0]
  }
)

​x
 
array.forEach(n => {  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().reverse()[0]  })

last item after sort

array.forEach(n => {
  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()[result.length-1]
  }
)

 
array.forEach(n => {  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()[result.length-1]  })

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Experimental features:

Memory measurements supported only in Chrome.
For precise memory measurements Chrome must be launched with --enable-precise-memory-info flag.
More information: Monitoring JavaScript Memory

Test case name	Result
first item after reverse
last item after sort

sort() vs reverse() when getting last item or first item (version: 1)

Comparing performance of: first item after reverse vs last item after sort

Created: 4 months ago by: Guest

Jump to the latest result

first item after reverse

last item after sort

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A

No previous run results