(algorithmic technique)
Definition: Solve a problem by repeatedly working on successive parts of the problem.
See also recursion.
Author: PEB
See dynamic algorithms for an example of one trade-off between speed and clarity for a recursive vs. an iterative implementation.
If you have suggestions, corrections, or comments, please get in touch with Paul E. Black.
Entry modified Thu Oct 27 10:00:37 2005.
HTML page formatted Thu Oct 27 10:13:14 2005.
Cite this as:
Paul E. Black, "iteration", from
Dictionary of Algorithms and Data
Structures, Paul E. Black, ed.,
NIST.
http://www.nist.gov/dads/HTML/iteration.html
