Library
Exercises
Games
Exams
Resources
Forum
News
Light
Log in
Sign up
Library
Exercises
Games
Exams
Resources
Forum
News
All courses
Library
Introduction to dynamic programming
Bottom-up approach vs memoization
MCQ
What is an advantage of the bottom-up approach (table filled by a loop) over recursive memoization?
Possible answers
It always gives a different, often more precise, result
It avoids the risk of call stack overflow caused by deep recursion
It works even when the subproblems do not overlap
It does not need to know the recurrence between subproblems
Log in to reply
Previous
Exercise 3 of 4
Next exercise
Report a mistake or suggest an improvement