Fundamentals of CS I (CS151 2002F)

Class 14: Repetition with Recursion

Back to Random Fun. On to Recursion with Lists.

Held Monday, September 23, 2002

Summary

Today we begin to consider one of the most powerful tools in Scheme, recursion. Recursion allows you to repeat operations.

Notes:

Overview

Repetition

Recursion

Some Examples

Recursion in Scheme

 

History

Thursday, 29 August 2002 [Samuel A. Rebelsky]

Monday, 23 September 2002 [Samuel A. Rebelsky]

 

Back to Random Fun. On to Recursion with Lists.

Disclaimer: 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 http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2002F/Outlines/outline.14.html.

You may wish to validate this document's HTML ; Valid CSS! ; Check with Bobby

Samuel A. Rebelsky, rebelsky@grinnell.edu