AI engineering glossary · Data structures algorithms
What is tabulation?
Tabulation (also called bottom-up dynamic programming): A bottom-up dynamic programming style that fills a table iteratively, starting from the smallest subproblems and using earlier entries to compute later ones. It avoids recursion and its overhead. It avoids recursion and usually makes the order of computation explicit.
Tabulation: an example
To compute fib(n), fill table[0] = 0, table[1] = 1, then table[i] = table[i-1] + table[i-2] up to n.
Related terms
More Data structures algorithms terms
Where you learn it
Tabulation is part of the AI Engineering Program, which teaches it with notes, a hands-on lab and an exam. The first lesson is free.