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

Class 30: Deep Recursion

Back to Pairs and Pair Structures. On to Deep Recursion Laboratory.

This outline is also available in PDF.

Held: Tuesday, March 13, 2007

Summary: Today we consider a variant of recursion known as deep recursion. In this variant, you often recurse in multiple directions, particularly on the car of each pair as well as on the cdr of each pair.

Related Pages:



Review: What is a List?

Complicating Structures: Nested Lists and Trees

Complicating Procedures: Deep Recursion


Back to Pairs and Pair Structures. On to Deep Recursion Laboratory.

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:48 2007.
The source to the document was last modified on Thu Jan 18 12:30:12 2007.
This document may be found at

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

Samuel A. Rebelsky,

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 or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.