Benchmark: Factorials-comp - MeasureThat.net

Script Preparation code:

function recfac(n){
  if(n<0)return;
  return !n||n*recfac(n-1);
}
function itefac(n){
  if(n<0)return;
  let res=1;
  while(n>1)(res*=n,n-=1);
  return res;
}
function arrfac(n){
  if(n<0)return;
  return Array(n).fill().map((e,i)=>i+1).reduce((a,b)=>a*b);
}
function memfac(x){
  let mem=[];
  function fac(n){
    if(n<0)return;
    return n<2?1:mem[n]||(mem[n]=n*memfac(n-1));
  }
  return fac(x);
}

Tests:

Recursive
for(let i=1;i<71;i++)recfac(i);
Iterative
for(let i=1;i<71;i++)itefac(i);
Array Reduction
for(let i=1;i<71;i++)arrfac(i);
Memoization
for(let i=1;i<71;i++)memfac(i);

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Recursive
Iterative
Array Reduction
Memoization

Fastest: N/A

Slowest: N/A

Latest run results:

No previous run results

This benchmark does not have any results yet. Be the first one to run it!

Related benchmarks:

Factorials-comp
Compute factorial of a number in JavaScript
successive ratios comparison
Factorial math

Factorials-comp (version: 0)

Comparing performance of: Recursive vs Iterative vs Array Reduction vs Memoization

Created: 8 years ago by: Guest

Jump to the latest result

Recursive

Iterative

Array Reduction

Memoization

Suite status: <idle, ready to run>

Fastest: N/A

Slowest: N/A

No previous run results