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


Class 13: Recursion with Natural Numbers

Back to Recursion with Lists . On to Preconditions and postconditions.

Held Friday, September 15, 2000

Summary

In recent classes, we've studied recursive procedures in which the argument is a list and the result a list, a number, or a boolean value. We now turn our attention to recursive procedures in which the argument is a number.

Notes

Overview


Can we recurse on values other than lists? Certainly. One natural set of values to recurse on is the natural numbers.

Some examples: factorial, sum-of-squares.


History

Thursday, 24 August 2000

Back to Recursion with Lists . On to Preconditions and postconditions.


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.13.html

Source text last modified Wed Sep 13 10:49:51 2000.

This page generated on Fri Sep 15 10:53:42 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu