Graph traversal #43

averychen940 22.05.2026 11:39

Graph traversal #43

Rewrote old code

solver.py

def memoize(fn):
    cache = {}
    def wrapper(*args):
        if args not in cache:
            cache[args] = fn(*args)
        return cache[args]
    return wrapper

@memoize
def expensive(n):
    return sum(range(n))

print(expensive(1000000))

app.py

def fib(n):
    if n <= 1: return n
    return fib(n-1) + fib(n-2)

print(fib(10))

Graph traversal #43

Are you sure you want to delete this post?