Fundamentals of CS I (CS151 2002F)

Class 40: Variable-Arity Procedures

Back to Tail Recursion, Continued. On to Multiple-Valued Procedures.

Held Wednesday, November 13, 2002

Summary

Today we consider how and why to write procedures that can take different numbers of arguments in different situations.

Related Pages

Assignments

Notes

Overview

Variable-Arity Procedures

Lab

 

History

Thursday, 29 August 2002 [Samuel A. Rebelsky]

Tuesday, 12 November 2002 [Samuel A. Rebelsky]

 

Back to Tail Recursion, Continued. On to Multiple-Valued Procedures.

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 Mon Dec 2 08:41:54 2002.
The source to the document was last modified on Tue Nov 12 21:47:48 2002.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS151/2002F/Outlines/outline.40.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu