24.2.7. Generic Memoization

Try these first

1. 1.

   What is memoization?

   Hint

   Think of it as a way to remember previous calculations.

2. 2.

   List the base cases for the Fibonacci sequence.

   Hint

   These are the starting points of the Fibonacci series.

3. 3.

   What does memoization aim to achieve?

   • Store function results
   • Make recursion faster
   • Both

   Hint

   Consider both aspects of what memoization does.

4. 4.

   True or False: Dynamic programming and memoization are the same.

   • True
   • False

   Hint

   Think about how each method tackles the problem.

5. 5.

   Implement a memoized version of the Fibonacci function in a language of your choice, and analyze its performance compared to the naive version.

   Hint

   Use a simple test with increasing values of n.

6. 6.

   Design a recursive algorithm for computing factorial numbers using memoization. Compare its implementation with a naive iterative approach.

   Hint

   Factorials grow quickly; how would caching help here?