NIST

recursion termination

(definition)

Definition: The point when conditions are met and a recursive algorithm ceases calling itself and begins to return values.

Author: PR


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

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

Entry modified 17 December 2004.
HTML page formatted Fri Mar 25 16:20:35 2011.

Cite this as:
Patrick Rodgers, "recursion termination", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed., U.S. National Institute of Standards and Technology. 17 December 2004. (accessed TODAY) Available from: http://www.nist.gov/dads/HTML/recursiontrm.html

to NIST home page