Computer Science Fundamentals (CS153 2004S)

Class 21: Algorithm Analysis (2)

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

Held: Wednesday, 25 February 2004

Summary: Today we continue with our investigation of algorithm analysis. In particular, we consider recurrence relations in some detail.

Related Pages:

Due

Assignments:

Notes:

Overview:

Review

Eliminating Constants

Doing Big-O Analysis

Care in Analysis

Relating Functions

Analyzing Recursive Procedures

Experimental Analysis

 

History

 

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

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:15 2004.
The source to the document was last modified on Tue Jan 13 10:26:11 2004.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS153/2004S/Outlines/outline.21.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu