Fundamentals of CS I (CS151 2001S) : Outlines

Class 37: Tail Recursion

Reading: Tail Recursion. Lab: Tail Recursion. Back to Script-Fu Concluded. On to Tail Recursion, Continued.

Held Monday, April 9, 2001

Summary

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

Notes

Overview

Two Kinds of Recursion

Making Procedures Tail Recursive

Tail Recursion and List Construction

 

History

Friday, 12 January 2001

 

Back to Script-Fu Concluded. On to Tail Recursion, Continued.

Disclaimer: I usually create these pages on the fly. This means that they are rarely proofread and may contain bad grammar and incorrect details. It also means that I may update them regularly (see the history for more details). Feel free to contact me with any suggestions for changes.

This page was generated by Siteweaver on Wed May 5 12:15:06 2004.
This page may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2001S/outline.37.html.
You may validate this page's HTML.
The source was last modified Tue Jan 23 16:01:58 2001.