[plt-scheme] Using tables for recursive functions

> If anyone's interested, drop me a line off-list and I'll send the worksheets.
>
> Todd
>

Enough people asked that compiling a list was too much work. Here's a
link to a wiki page with a download:

https://www.dupontmanual.org/wikis/intro/Arrangements

I started with the following data definitions:

;; A word is:
;; empty, or
;; (cons symbol word)
(we agree to limit the symbols to single letters)

;; A list-of-word is:
;; empty, or
;; (cons word list-of-word)

The worksheet is the result of tweaking the word-fun and
list-of-word-fun templates.

Todd