Computer Science Fundamentals (CS153 2003S)

Class 19: Algorithm Analysis

Back to More Higher-Order Procedures. On to More Algorithm Analysis.

Held: Wednesday, 19 February 2003

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

Related Pages:

Notes:

Overview:

Comparing Algorithms

Difficulties Analyzing Running Times

Asymptotic Analysis

Eliminating Constants

Asymptotic Analysis in Practice

The Role of Details

 

History

Thursday, 15 January 2003 [Samuel A. Rebelsky]

Wednesday, 19 February 2003 [Samuel A. Rebelsky]

 

Back to More Higher-Order Procedures. On to More Algorithm Analysis.

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 6 09:20:34 2003.
The source to the document was last modified on Wed Feb 19 08:39:28 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2003S/Outlines/outline.19.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu