Benchmark: Compute factorial of a number in JavaScript

Script Preparation code:

function factorializeRecursive(num) {
  if (num < 0) 
        return -1;
  else if (num == 0) 
      return 1;
  else {
      return (num * factorializeRecursive(num - 1));
  }
}


function factorializeLoop(num) {
  var result = num;
  if (num === 0 || num === 1) 
    return 1; 
  while (num > 1) { 
    num--;
    result *= num;
  }
  return result;
}

Tests:

Finding factorial using loop
var r = factorializeLoop(20);
Finding factorial using recursion
var r = factorializeRecursive(20);

Rendered benchmark preparation results:

Suite status: <idle, ready to run>

Previous results

Test case name	Result
Finding factorial using loop
Finding factorial using recursion

Fastest: N/A

Slowest: N/A

ⓘ Get performance results from real users on your website with Request Metrics.

Website Performance Monitoring by Request Metrics

Latest run results:

Run details: (Test run date: 2 years ago)

User agent: Mozilla/5.0 (X11; Linux x86_64) AppleWebKit/537.36 (KHTML, like Gecko) Chrome/99.0.4844.82 Safari/537.36

Browser/OS: Chrome 99 on Linux

View result in a separate tab

Test name	Executions per second
Finding factorial using loop	11632730.0 Ops/sec
Finding factorial using recursion	555011.1 Ops/sec

Compute factorial of a number in JavaScript (version: 3)

Iterative and recursive versions Implementations borrowed from https://medium.freecodecamp.org/how-to-factorialize-a-number-in-javascript-9263c89a4b38

Comparing performance of: Finding factorial using loop vs Finding factorial using recursion

Created: 5 years ago by: Registered User

Jump to the latest result

Finding factorial using loop

Finding factorial using recursion

Suite status: <idle, ready to run>

Experimental features:

Fastest: N/A

Slowest: N/A