CS Behind the Curtain (CS195 2003S)

Class 23: Asymptotic Analysis

Back to Program Documentation. On to Pointers and Functions.

Held: Wednesday, 26 February 2003

Summary: Today we consider mechanisms for analyzing the running time of algorithms.



Comparing Algorithms

Difficulties Analyzing Running Times

Asymptotic Analysis

Eliminating Constants

Asymptotic Analysis in Practice

The Role of Details

Eliminating Constants

Doing Big-O Analysis

Relating Functions

Analyzing Recursive Procedures

Experimental Analysis



Tuesday, 7 January 2003 [Samuel A. Rebelsky]

Wednesday, 26 February 2003 [Samuel A. Rebelsky]

Wednesday, 27 February 2003 [Samuel A. Rebelsky]


Back to Program Documentation. On to Pointers and Functions.

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 2 14:20:36 2003.
The source to the document was last modified on Thu Feb 27 23:31:11 2003.
This document may be found at http://www.cs.grinnell.edu/~rebelsky/Courses/CS195/2003S/Outlines/outline.23.html.

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

Samuel A. Rebelsky, rebelsky@grinnell.edu