A simple demonstration of memoization for the Fibonacci function

memoization.js

// Higher order memoize function
function memoize (fn) {
    const lookup = {}
    const memoized = function () {
        const args = Array.from(arguments)
        if (args in lookup) {
            return lookup[args]
        }
        return (lookup[args] = fn.apply(this, args))
    }
    memoized.getLookup = () => lookup
    return memoized
}

// Original fibonacci function
function fibonacci (n) {
    if (n === 0 || n === 1) {
        return n
    }
    return fibonacci(n - 1) + fibonacci(n - 2)
}

// Memoized fibonacci function
const memoizedFibonacci = memoize(fibonacci)

// Redefine fibonacci to recursively use the memoized version (cache intermediate results)
function fibonacci (n) {
    if (n === 0 || n == 1) {
        return n
    }
    return memoizedFibonacci(n - 1) + memoizedFibonacci(n - 2)
}

// See how the cached results grow with memoizedFibonacci.getLookup()
// e.g.,
// memoizedFibonacci.getLookup() --> {}
// fibonacci(5) --> 5
// memoizedFibonacci.getLookup() --> {0: 0, 1: 1, 2: 1, 3: 2, 4: 3}