Fundamentals of Computer Science 1 (CS151 2003S)

Class 41: Tail Recursion (1)

Back to Discussion of Exam 2. On to Tail Recursion (2).

Held: Monday, 14 April 2003

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

Related Pages:



Two Kinds of Recursion

Making Procedures Tail Recursive

Tail Recursion and List Generation




Thursday, 16 January 2003 [Samuel A. Rebelsky]

Sunday, 13 April 2003 [Samuel A. Rebelsky]


Back to Discussion of Exam 2. On to Tail Recursion (2).

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:30:13 2003.
The source to the document was last modified on Sun Apr 13 21:39:59 2003.
This document may be found at

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

Samuel A. Rebelsky,