This outline is also available in PDF.
Held: Tuesday, March 9, 2010
Summary: We consider a different form of recursion, one based on the construction of recursive helpers that take additional parameters. Along the way, we consider the idea of tail recursion. We also explore how careless design of recursive procedures can inadvertently lead to slow execution.
tail recursion) adds an extra parameter to the recursive procedure
partial-sum unexplored-elements 0 (2 3 5 7 11 13) 2 (3 5 7 11 13) 5 (5 7 11 13) 8 (7 11 13) 15 (11 13) 26 (13) 39 ()
tailof the procedure), then we say that the procedure is tail recursive.
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 11 09:03:12 2010.
The source to the document was last modified on Thu Jan 21 13:05:10 2010.
This document may be found at
You may wish to validate this document's HTML ; ;Samuel A. Rebelsky, email@example.com
http://creativecommons.org/licenses/by-nc/2.5/or send a letter to Creative Commons, 543 Howard Street, 5th Floor, San Francisco, California, 94105, USA.