mit 6.0001 Fibonacci - dynamic programming

fib_eff.py

def fib_eff(n, dict):
  '''
  performace-aware recursive algorithm: 
  keep track of computed Fibonacci terms in a dictionary; 
  limit computation to terms not in the dictionary
  '''
  if n in dict:
    return dict[n]
  else:
    fibn = fib_eff(n-1, dict) + fib_eff(n-2, dict)
    dict[n] = fibn
    return fibn

if __name__ == "__main__":
  dict = {0:1, 1:1}
  n = int(input('Which Fibonacci term?: '))
  print(f'Fibonacci term {n} is {fib_eff(n, dict)}')