This outline is also available in PDF.
Held: Tuesday, 11 March 2008
We visit a slightly different kind of recursion, numeric recursion. In
this technique, we once again have procedures call themselves. However,
the parameter that we
simplify at every step is a number, rather
than a list.
(define recursive-proc (lambda (params) (if (base-case-test) (base-case params) (combine (partof params) (recursive-proc (simplify params))))))
(define recursive-proc (lambda (params) (cond ((base-case-test) (base-case params)) ((special-case-test) (combine (partof params) (recursive-proc (simplify params)))) (else (recursive-proc (simplify params))))))
take the cdrand the
part-ofwas almost always
take the car.
I usually create these pages
on the fly, which means that I rarely
proofread them and they may contain bad grammar and incorrect details.
It also means that I tend to update them regularly (see the history for
more details). Feel free to contact me with any suggestions for changes.
This document was generated by
Siteweaver on Tue Apr 15 23:11:40 2008.
The source to the document was last modified on Thu Jan 17 16:44:14 2008.
This document may be found at
You may wish to validate this document's HTML ; ;Samuel A. Rebelsky, email@example.com
http://creativecommons.org/licenses/by-nc/2.5/or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.