(algorithmic technique)

Definition: Solve a problem by repeatedly working on successive parts of the problem.

See also recursion.

Author: PEB

More information

See dynamic algorithms for an example of one trade-off between speed and clarity for a recursive vs. an iterative implementation.

Go to the Dictionary of Algorithms and Data Structures home page.

If you have suggestions, corrections, or comments, please get in touch with Paul Black.

Entry modified 27 October 2005.
HTML page formatted Tue Feb 12 10:57:43 2019.

Cite this as:
Paul E. Black, "iteration", in Dictionary of Algorithms and Data Structures [online], Vreda Pieterse and Paul E. Black, eds. 27 October 2005. (accessed TODAY) Available from: