Computer Science Fundamentals (CS153 2003S)

Class 21: Tail Recursion

Back to More Algorithm Analysis. On to Searching.

Held: Monday, 24 February 2003

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, 15 January 2003 [Samuel A. Rebelsky]

Monday, 24 February 2003 [Samuel A. Rebelsky]

 

Back to More Algorithm Analysis. On to Searching.

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:20:37 2003.
The source to the document was last modified on Mon Feb 24 09:14:34 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2003S/Outlines/outline.21.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu