**Explanation**: Generates the nth Fibonacci number recursively by summing the two preceding numbers.

^{[Back to top](#algorithms)}

⚠️ **Note**: This approach has exponential time complexity `O(2^n)` and is inefficient for large inputs.

^{[Back to top](#algorithms)}

function factorial(n) {

if (n < 0)thrownewRangeError('Factorial is not defined for negative numbers');

if (n < 0)

if (n === 0 || n === 1) return 1;

return n * factorial(n - 1);

}