Recursive Factorial with Caching

This function calculates the factorial of a given non-negative integer. It uses recursion and caching to optimize the calculation process.

Technology Stack : Built-in functions, recursion, dictionary

Code Type : Mathematical calculation function

Code Difficulty : Intermediate

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