Fund. CS II (CS152 2006S)

Class 34: Algorithm Analysis (2)

Back to Algorithm Analysis (1). On to Algorithm Analysis (3).

Held: Tuesday, April 4, 2006

Summary: Today we formalize techniques for comparatively evaluating the running time of algorithms.

Related Pages:



Asymptotic Analysis

Asymptotic Analysis in Practice

Experimental Analysis

Eliminating Constants

Relating Functions

Back to Algorithm Analysis (1). On to Algorithm Analysis (3).

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 Tue May 9 08:31:46 2006.
The source to the document was last modified on Thu Jan 12 14:58:06 2006.
This document may be found at

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

Samuel A. Rebelsky,