Held: Friday, 21 February 2003
Summary: Today we continue with our investigation of algorithm analysis.
unimportantbecause they can be
hiddenin the d.
constant, then what else can we say about f(n) and g(n)?
shrinkfunction gives you a sense of how many recursive calls you need to do
shrinkdoes it take to reduce the argument to the base case.
analyze them experimentally? I mean that we can time them on a variety of inputs and graph the results.
Thursday, 15 January 2003 [Samuel A. Rebelsky]
Friday, 21 February 2003 [Samuel A. Rebelsky]
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 6 09:20:35 2003.
The source to the document was last modified on Fri Feb 21 09:34:01 2003.
This document may be found at