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 Black.

Entry modified 17 December 2004.
HTML page formatted Tue May 6 13:48:56 2014.

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