Fundamentals of Computer Science I (CSC-151.02 2000F)


Class 34: Tail recursion

Back to Procedures as values, revisited. On to Variable-arity procedures.

Held Monday, October 30, 2000

Summary

Today we investigate tail recursion, a technique for making recursive procedures more efficient.

Notes

Overview


Do the lab


History

Thursday, 24 August 2000

Monday, 30 October 2000

Back to Procedures as values, revisited. On to Variable-arity procedures.


Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2000F/Outlines/outline.34.html

Source text last modified Mon Oct 30 10:57:31 2000.

This page generated on Tue Oct 31 10:54:59 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu