Bottom-up

Also written: bottom-up DP

Dynamic programming with no recursion: you fill a table from the smallest subproblem upward, as in the fewest-bags table.

Where the book teaches it