A Bottom-Up Algorithm solves a problem iteratively. First solve the most basic problem, store the solution, and use the solution in the next iteration, until the whole problem has been solved. Example: Solving for the nth number in the Fibonacci Sequence iteratively. This is a natural way to solve problems on paper.

A Top-Down Algorithm takes another approach.