Implementing a Simple Memoization Cache

Snippet

Implementing a Simple Memoization Cache

Memoization is a technique to optimize functions by caching their results based on input arguments. For expensive recursive or repetitive operations, this can transform exponential time complexity into linear complexity.

snippet.js
javascript
const memoize = (fn) => {
  const cache = new Map();
  return (...args) => {
    const key = JSON.stringify(args);
    if (cache.has(key)) return cache.get(key);
    
    const result = fn(...args);
    cache.set(key, result);
    return result;
  };
};
 
const fibonacci = memoize((n) => {
  return n <= 1 ? n : fibonacci(n - 1) + fibonacci(n - 2);
});

nodejs

Breakdown

const cache = new Map();

Uses a Map to store results of previous function calls.

const key = JSON.stringify(args);

Generates a unique cache key based on the input arguments.

if (cache.has(key)) return cache.get(key);

Returns the pre-calculated value if it exists in the cache.

Previous snippet Next snippet

More Intermediate JavaScript exercises →

From your library

Implementing a Simple Memoization Cache

Related