null created by ikardi420 - https://repl.it/KFM2/1

KFM2-1.py

def fafib(n,memo={}):
  """Assumes n is an int>=0,memo used only by recursive calls Return Fibonacci of n"""
  if n == 0 or n == 1:
    return 1
  try:
    return memo[n]
  except KeyError:
    result= fafib(n-1,memo)+fafib(n-2,memo)
    memo[n]=result
    return result