Hands-On Functional Programming with TypeScript

Recursion

A function that calls itself is known as a recursive function. The following function is a recursive function and allows us to calculate the factorial of a given number, n. The factorial is the product of all positive integers less than, or equal to, a given number, n:

const factorial = (n: number): number => (n === 0) ? 1 : (n * factorial(n - 1));

We can invoke the preceding function as follows:

factorial(5); // 120

In general, you should try to implement functions without recursion. Using recursion should be considered carefully because the JavaScript runtime is not very efficient at handling it since, in a recursive function call, a frame is added to the stack with each function call.