Scheme (programming language): Difference between revisions

Revision as of 10:51, 29 October 2003

Revision as of 00:20, 9 November 2003

Line 151:

;; => (1 4 9 16)

We can define both of these tail-recursively as follows. The ''named'' <code>let</code> statement and the <code>do</code> statement are syntactic sugar which simpifysimplify tail-recursive definitions. To use factorial and map again to illustrate both forms:

(define (factorial n)

Line 171:

;; => (1 4 9 16)

Please note that in both cases, the tail-recursive version is preferrable due to its decreased use of space.

=== Input/output ===