Skip to content
UPEEC

Tabulation

Bottom-up dynamic programming: fill a table from the smallest subproblems up.

Intermediate
Comments 0

No recursion overhead; often allows reducing memory to a few rows.

Spotted a mistake or want to add detail? Suggest an improvement — Content Contributors' edits are reviewed by editors before they go live.

Discussion (0)

Sign in or join free to ask questions and discuss this topic.