Bottom-up

Also written: DP table, table

Dynamic programming with no recursion: you fill a table from the smallest subproblem upward, such as the fewest bags for 0 lb, 1 lb, 2 lb and so on. It avoids stack overflow on large inputs.