iteration (original) (raw)

NIST

(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 theDictionary 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 Wed Oct 30 12:15:30 2024.

Cite this as:
Paul E. Black, "iteration", inDictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 27 October 2005. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/iteration.html