Recursion

Iteration

    "O, thou hast damnable iteration and are
       indeed able to corrupt a saint."
     Falstaff  in   Henry IV

Recursion

External links: Definition of Recursion at Wikipedia; World of Escher

Here is a simple, recursive function exponent

              (defun exponent (x y)
                  (cond ((= y 0) 1)
                           (t (* x (exponent x (- y 1))))))

Here is a version of the tak function, which is heavily recursive.

(defun tak (x y z)
       (cond ((not (ilessp y x)) z)
               (t (tak (tak (isub1 x) y z)
                         (tak (isub1 y) z x)
                         (tak (isub1 z) x y)))))

Gordon Joly (Recursion) offers Internet research and consultancy services, as well as Linux systems and application installation.

Please email recursion@pobox.com or telephone 020 7515 4964 for more information.

Recursion begins at home

Last updated 2005-04-21