dynamic programming in python using the @lru_cache decorator

fibonacci.py

#from functools import lru_cache#python >=3.2
from functools32 import lru_cache#python 2.7
#from repoze.lru import lru_cache#python 2.7

#NOTE: you can use python -m trace --count fibonacci.py
#to see how many times each instruction is called

#@lru_cache(maxsize=500)#repoze.lru needs maxsize arg
@lru_cache()#using functools32
def fibonacci(n):
    if n<=1:
        return n
    return fibonacci(n-1)+fibonacci(n-2)
print(fibonacci(100))

#manual dynamic programming way
#cache ={0:0,1:1}
#def fibonacci(n):
#    if n in cache:
#        return cache[n]
#    cache[n] = fibonacci(n-1)+fibonacci(n-2)
#    return cache[n]

when i run this program it take time and at last occur an error.

maybe we need @lru_cache(maxsize=None) ?

maybe we need @lru_cache(maxsize=None) ?

for the Fibonacci Series, we only need to cache the last two elements. Hence, @lru_cache(maxsize=2) would make more sense.