Recursion call stacks - mmedrano9438/peripheral-brain GitHub Wiki

The act of a function calling itself, recursion is used to solve problems that contain smaller sub-problems. A recursive function can receive two inputs: a base case (ends recursion) or a recursive case (resumes recursion).

const factorial = (n) => { if (n === 0) { return 1; } else { return n * factorial(n - 1); } }; console.log(factorial(10)); // 3628800