Recursive Factorial Calculation with Caching

This function calculates the factorial of an integer using recursion and caching to optimize performance.

Technology Stack : Recursion, Caching

Code Type : Function

Code Difficulty : Intermediate

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