Fundamentals of Computer Science I (CS151 2003F)

Class 29: Deep Recursion

Back to Pairs and Pair Structures. On to Early Break.

Held: Thursday, 16 October 2003

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

Related Pages:

Assignments

Notes:

Overview:

Review: What is a List?

Review: List Recursion

Complicating Structures: Nested Lists and Trees

Complicating Procedures: Deep Recursion

Extending length

Example: Determining the Depth of a Nested List

Lab

 

History

Thursday, 28 August 2003 [Samuel A. Rebelsky]

 

Back to Pairs and Pair Structures. On to Early Break.

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 Dec 9 13:59:47 2003.
The source to the document was last modified on Mon Sep 1 13:30:51 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2003F/Outlines/outline.29.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu