June 2018
Intermediate to advanced
280 pages
7h 46m
English
Calling the preceding Fibonacci implementation multiple times will result in a waste of CPU cycles, since some steps are the same and we are guaranteed that, for the same input, we'll always get the same output (pure function). To speed up the call, we can cache the output, and for the given input, just return the cached result, instead of actually calculating it.
Read now
Unlock full access