Fundamentals of CS I (CS151 2002F)

Class 38: Tail Recursion

Back to Pause for Breath. On to Tail Recursion, Continued.

Held Monday, November 11, 2002

Summary

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

Related Pages

Notes

Overview

Two Kinds of Recursion

Making Procedures Tail Recursive

Tail Recursion and List Construction

 

History

Thursday, 29 August 2002 [Samuel A. Rebelsky]

Monday, 11 November 2002 [Samuel A. Rebelsky]

 

Back to Pause for Breath. On to Tail Recursion, Continued.

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 Mon Dec 2 08:41:49 2002.
The source to the document was last modified on Mon Nov 11 08:24:19 2002.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2002F/Outlines/outline.38.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu