factorial-memo-closure

// Task 1: Without peeking, write your own recursive factorial method

// Task 2: Use your memo function from the previous exercise to memoize your factorial method

const memoize = cb => {
  const cache = {};

  return (...args) => {
    let n = args[0];

    if (n in cache) {
      console.log("In CACHE!!");

      return cache[n];
    }

    let result = cb(n);
    cache[n] = result;

    return cache[n];
  };
};

const factorial = memoize(x => {
  if (x === 0) {
    return 1;
  } else {
    return x * factorial(x - 1);
  }
});

console.log(factorial(100));
console.log(factorial(5));