freeCodeCamp Basic Algorithm Scripting: Challenge 02 - Recursion

fcc-factorialize-a-number

// example of recursive algorithm

function factorialize(num) {
  if (num < 0) {
    return -1; // error msg
  }
  else if (num === 0) {
    return 1; // base case
  }
  else {
  return (num * factorialize(num - 1)); // general case 
  }
}

factorialize(5);