Read the Big-O
Fibonacci That Remembers
The same function, but now every result is kept in a dictionary. How does the time grow?1memo = {}
2
3def fib(n):
4 if n < 2:
5 return n
6 if n not in memo:
7 memo[n] = fib(n - 1) + fib(n - 2)
8 return memo[n]