Computer Science Fundamentals (CS153 2004S)

Class 20: Algorithm Analysis (1)

Back to Tail Recursion. On to Algorithm Analysis (2).

Held: Monday, 23 February 2004

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

 

Back to Tail Recursion. 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 Fri May 7 09:43:14 2004.
The source to the document was last modified on Tue Jan 13 10:26:10 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2004S/Outlines/outline.20.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu