Function-level Caching in JavaScript using Memoization

In this video I demonstrate how to use the memoization pattern to implement a function level cache in javascript. To do that, the following language features of javascript are used:

*) Closures
*) Functions as parameters
*) Functions that return functions

[missizzyc]

Ah best explanation of this technique, the simple first example helped me finally understand what the computer is doing when it's making those recursive calls...

[raysunqi]

This is my FE engineer interview question, thanks for sharing!

[DanielRamBeats]

This makes sense, but for those just learning this technique. Rather than using an array, it would make sense to use an object literal right? As the function being memoized can only ever have one output for the same input, using an object literal would ensure no duplicate keys are every possible and makes it more descriptive to the person reading the code. Also, in cases where the input is not a number, it a key property associated to the calculation would also be more flexible.

[RogerKeulen]

For fib(n) memorization makes scense. But code generation and pre-calculation could also be a sollution for this example.

[javascriptduniya]

var cache =[] is setting empty every time here when function memorizer is called?

[saikoushik]

How to get execution time? I mean any in-built js function?

[kollerjon]

Hey, why do you turn n into a string? Is it strictly necessary?

[dantewhite]

here because i want a better understanding of how to use Apollo,

[xanaduzhang]

```
const memorizer = f => { .. .. .. .. .. .. };
const _slowFun = n => n+1;
const slowFun = memorizer(_slowFun};
export { slowFun };
```

[xanaduzhang]

```
const memorizer = (f, exp) => { if(exp).. .. .. .. .. .. };
const _slowFun = n => n+1;
const slowFun = (n, exp=false) => memorizer(_slowFun, exp} ;
export { slowFun };
```