Solution for fibonacci using the memoization technique

fibonacci_memoization.js

fibonacci function(n, cache) {
  cache = cache || {};
  if (n === 0) return 0;
  if (n === 1) return 1;
  if (cache[n]) return cache[n];
  return cache[n] = this.fibonacci(n - 1, cache) + this.fibonacci(n - 2, cache);
};