Bottom-up

Also written: bottom-up DP, DP table, table

Dynamic programming with no recursion: you fill a table from the smallest subproblem upward, so each entry uses answers already in the table. It cannot overflow the call stack.