Recursive Factorial with Caching

This function calculates the factorial of a number using recursion and caching to optimize performance.

Technology Stack : Recursion, Caching

Code Type : Mathematical calculation function

Code Difficulty : Intermediate

                
                    
def factorial(n, cache={}):
    if n in cache:
        return cache[n]
    if n == 0:
        return 1
    else:
        cache[n] = n * factorial(n - 1)
        return cache[n]