Revision as of 15:43, 16 July 2006 edit CBM (talk \| contribs) Extended confirmed users, File movers, Pending changes reviewers, Rollbackers 55,390 edits m →Recursive algorithms: edit link ← Previous edit		Revision as of 09:59, 6 August 2006 edit undo MattGiuca (talk \| contribs) Extended confirmed users 2,415 edits m →Double-Test Tail Recursion: sp Next edit →
Line 103: ====Double-Test Tail Recursion==== The most common ~~variat~~variant of Tail recursive function is double-test tail recursion. This type of recursion first tests if the recursion reached the end (without finding the result), then tests if it found result and if neither if true, calls it self recursively. The template in [[Common Lisp]] would be: (DEFUN ''func'' (X)

Recursion (computer science): Difference between revisions