(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 27 October 2005.
HTML page formatted Mon Sep 11 09:46:04 2006.
Cite this as:
Paul E. Black, "iteration", in
Dictionary of Algorithms and Data
Structures [online], Paul E. Black, ed.,
U.S. National Institute of
Standards and Technology. 27 October 2005. (accessed TODAY)
Available from: http://www.nist.gov/dads/HTML/iteration.html
