Fundamentals of Computer Science I (CS151 2003F)

Class 41: Tail Recursion

Back to Variable-Arity Procedures. On to Association Lists.

Held: Thursday, 13 November 2003

Summary: Today we revisit recursion and consider a more efficient way to write recursive procedures. This technique is called tail recursion.

Related Pages:

Assignments

Notes:

Overview:

Two Kinds of Recursion

Making Procedures Tail Recursive

Tail Recursion and List Generation

Lab

 

History

Thursday, 28 August 2003 [Samuel A. Rebelsky]

 

Back to Variable-Arity Procedures. On to Association 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 Tue Dec 9 13:59:55 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.41.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu