I think recursion is simple enough if explained well, but is not needed for
LISP. The simplest explanation I can think of is to imagine that the function
works inside of the function.
For example:
factorial:
(defun factorial (x)
(if (= x 0) 0 (* x (get-fact (1- x)))))
now if we onlt had a way to find the factorial (get-fact) of a number minus
one.
well, you do, you have factorial.
I hope that made at least a little sense, I didn;t say it very well.
--