Memoization
123456789101112131415161718192021
def fib(n):
if n == 0:
return 0
elif n == 1:
return 1
else:
return fib(n-1) + fib(n-2)
def memoize(f):
memo = {}
def memoized_func(n):
if n not in memo:
memo[n] = f(n)
return memo[n]
return memoized_func
fib = memoize(fib)
fib(6)
print(fib(6))
Python
INFO