Fundamentals of Computer Science I (CS151.02 2007S)

Class 12: Recursion, Revisited

Back to Recursion. On to Recursion with Lists.

This outline is also available in PDF.

Held: Friday, February 9, 2007

Summary: Today we continue our consideration of the process of recursion.

Related Pages:

Due

Notes:

Overview:

Questions and Answers

Lab

Some Extra Stuff

I included the following notes in previous offerings of this course. I will cover them if (or when) questions suggest that such coverage is necessary.

Detour: Scheme's Evaluation Strategy

Another Example: Difference

Back to Recursion. 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 Thu Sep 13 20:54:41 2007.
The source to the document was last modified on Thu Jan 18 12:30:12 2007.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2007S/Outlines/outline.12.html.

You may wish to validate this document's HTML ; Valid CSS! ; Creative Commons License

Samuel A. Rebelsky, rebelsky@grinnell.edu

Copyright © 2007 Samuel A. Rebelsky. This work is licensed under a Creative Commons Attribution-NonCommercial 2.5 License. To view a copy of this license, visit 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.