recursive_dp_fibonacci.py

from timeit import timeit

setup = """
results = [0 for _ in xrange(100)]
results[1] = 1
results[2] = 1

def fib(n):
    if results[n]:
        return results[n]
    results[n] = fib(n - 1) + fib(n - 2)
    return results[n]
"""

timeit(stmt='fib(35)', setup=setup, number=1000000)

setup = """
def fib(n):
    a, b = 1, 1
    for _ in xrange(n - 1):
        a, b = b, a + b
    return a
"""
timeit(stmt='fib(35)', setup=setup, number=1000000)