Recursion (computer science): Difference between revisions

Revision as of 07:29, 6 July 2006

Revision as of 14:58, 8 July 2006

Line 93:

===Tail recursive function===

A function executes a number of tests and then if a certain test is true returns a certain value. If all tests evaluated as false, the function calls it self recursively on reduced input value. In taliltail recursive functions, the return value of last function call is the return value of the whole recursion. The template in [[Common Lisp]] would be:

(DEFUN ''func'' (X)