Bottom-up
Also written: bottom-up DP, DP table
Dynamic programming that skips recursion and fills a table from the smallest subproblem upward. Each entry is worked out from smaller entries already stored, as in `fewest_table`.
Also written: bottom-up DP, DP table
Dynamic programming that skips recursion and fills a table from the smallest subproblem upward. Each entry is worked out from smaller entries already stored, as in `fewest_table`.