Programming

In this section we consider a bottom-up algorithmic paradigm
called *dynamic programming* .
In order to solve a given problem,
a series of subproblems is solved.
The series of subproblems is devised carefully in such a way
that each subsequent solution is obtained by combining
the solutions to one or more of the subproblems that have already been solved.
All intermediate solutions are kept in a table
in order to prevent unnecessary duplication of effort.

- Example-Generalized Fibonacci Numbers
- Example-Computing Binomial Coefficients
- Application: Typesetting Problem

Copyright © 1997 by Bruno R. Preiss, P.Eng. All rights reserved.