Recursion termination: Difference between revisions

Revision as of 21:39, 27 January 2019

Revision as of 11:33, 28 January 2019

Line 1:

<!-- Please do not remove or change this AfD message until the discussion has been closed. -->

{{Article for deletion/dated|page=Recursion termination|timestamp=20190128113254|year=2019|month=January|day=28|substed=yes}}

<!-- Once discussion is closed, please place on talk page: {{Old AfD multi|page=Recursion termination|date=28 January 2019|result='''keep'''}} -->

<!-- End of AfD message, feel free to edit beyond this point -->

In computing, '''recursion termination''' is when certain conditions are met and a [[recursive algorithm]] stops calling itself and begins to return values. This happens only if, with every recursive call, the recursive algorithm changes its state and moves toward the base case. Cases that satisfy the definition, without being defined in terms of that definition, are called base cases. They are small enough to solve directly.<ref>

{{Citation