Computer Science Fundamentals (CS153 2004S)

Class 19: Tail Recursion

Back to Higher-Order Procedures (3). On to Algorithm Analysis (1).

Held: Friday, 20 February 2004

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

Related Pages:

Assignments:

Notes:

Overview:

Two Kinds of Recursion

Making Procedures Tail Recursive

Tail Recursion and List Construction

Lab

 

History

Thursday, 19 February 2004 [Samuel A. Rebelsky]

 

Back to Higher-Order Procedures (3). On to Algorithm Analysis (1).

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 Fri May 7 09:43:13 2004.
The source to the document was last modified on Thu Feb 19 21:30:41 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2004S/Outlines/outline.19.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu