Fundamentals of Computer Science 1 (CS151 2003S)

Class 29: Deep Recursion

Back to Vectors. On to Procedures as Values.

Held: Monday, 10 March 2003

Summary: Today we consider a variant of recursion known as deep recursion. In this variant, you often recurse in multiple directions, such as into sublists in addition to across top-level lists.

Related Pages:




Review: List Recursion

Complicating Things: Deep Recursion

Extending length

Determining the Depth of a Nested List



Thursday, 16 January 2003 [Samuel A. Rebelsky]

Monday, 10 March 2003 [Samuel A. Rebelsky]


Back to Vectors. On to Procedures as Values.

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 Tue May 6 09:30:00 2003.
The source to the document was last modified on Mon Mar 10 12:31:28 2003.
This document may be found at

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

Samuel A. Rebelsky,