Held Monday, September 23, 2002
Today we begin to consider one of the most powerful tools in Scheme, recursion. Recursion allows you to repeat operations.
Now play with it on the computertime.
lengthprocedure does not exist.
(define proc (lambda (val) (if (base-case-test) (base-case val) (combine (partof val) (proc (update val))))))
(define proc (lambda (lst) (if (null? lst) null-case (combine (onestep (car val)) (proc (cdr val))))))
Thursday, 29 August 2002 [Samuel A. Rebelsky]
Monday, 23 September 2002 [Samuel A. Rebelsky]
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 Mon Dec 2 08:41:04 2002.
The source to the document was last modified on Mon Sep 23 08:24:59 2002.
This document may be found at