Recursive Functions in Javascript
A function which can call itself
function factorial(n) {
if ((n === 0) || (n === 1))
return 1;
else
return (n * factorial(n - 1));
}
console.log(factorial(4));
//24
Best practices
- Identify the base case
- Identify the recursive case
- Get closer and return the calculated value
- It will have the 2 returns