Fund. CS II (CS152 2004F)

Class 24: Algorithm Analysis (1)

Back to Project Discussion. On to Algorithm Analysis (2).

Held: Wednesday, 6 October 2004

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

Related Pages:

Assignments

Notes:

Overview:

Motivating Problem: Exponentiation

Comparing Algorithms

Difficulties Analyzing Running Times

Back to Project Discussion. On to Algorithm Analysis (2).

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 Wed Dec 8 10:37:17 2004.
The source to the document was last modified on Thu Aug 26 20:22:23 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS152/2004F/Outlines/outline.24.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu