Cached Fibonacci implementations

main.dart

Map<int, int> cache = new Map();

int fibo(int n){

  if(cache.containsKey(n))
  {
    return cache[n];
  }
  
  int result;
  if(n == 0) {
    result = cache[0] = 1;
    return result;
  }
  if(n == 1) {
    result = cache[1] = 1;
    return result;
  }

  result =  fibo(n-2) + fibo(n-1);
  cache[n] = result;
  return result;
}

void main() {
  for (int i = 0; i < 10; i++) {
    print('N=${i} : ${fibo(i + 1)}');
  }
}

main.py

#!/usr/bin/python

cache = {}

def fibo(n):
  if n == 0: return 1
  if n == 1: return 1
  
  result = 0
  if n in cache:
    result = cache[n]
  else:
    result = fibo(n-1) +fibo(n-2)
    cache[n] = result
  
  return result

for x in range(350):
  print(fibo(x))