Definition: The point when conditions are met and a recursive algorithm ceases calling itself and begins to return values.
If you have suggestions, corrections, or comments, please get in touch with Paul Black.
Entry modified 17 December 2004.
HTML page formatted Wed Mar 13 12:42:46 2019.
Cite this as:
Patrick Rodgers, "recursion termination", in Dictionary of Algorithms and Data Structures [online], Paul E. Black, ed. 17 December 2004. (accessed TODAY) Available from: https://www.nist.gov/dads/HTML/recursiontrm.html