24.2. Memoization

Try these first

1. 1.

   What is memoization?

   Hint

   Think about how caching works.

2. 2.

   What are the base cases for Fibonacci numbers?

   Hint

   What are the first values in the Fibonacci sequence?

3. 3.

   What is the primary purpose of memoization?

   • To reduce memory usage
   • To store previously computed results
   • To simplify code

   Hint

   Think about how saving results can help in computations.

4. 4.

   Memoization improves the time complexity of recursive functions. True or False?

   • True
   • False

   Hint

   Consider what happens when redundant work is minimized.

5. 5.

   Create a memoized recursive function for calculating factorial numbers and explain how it will optimize performance.

   Hint

   Use your knowledge from Fibonacci to implement this effectively!

6. 6.

   Design an algorithm for computing the nth Fibonacci number using dynamic programming approach and explain how it's different from memoization.

   Hint

   Think of building the sequence in a loop instead of through recursive calls.