Fundamentals of Computer Science II (CSC-152 2000F)

Class 23: Algorithm Analysis

Back to GUIs, Revisited. On to Algorithm Analysis, Continued.

Held Tuesday, October 3, 2000


Today we move from details of Java to consideration of the ways in which one might compare and analyze algorithms. We will ground our analysis in a few sample algorithms for finding the smallest value in an array.



Algorithms, Revisited

Algorithm Analysis

Difficulties Analyzing Running Times

Is there an exact number we can provide for the running time of an algorithm? Surprisingly, no.

Asymptotic Analysis

Eliminating Constants

Asymptotic Analysis in Practice

Our Smallest Algorithms

The Role of Details


Wednesday, 23 August 2000

Thursday, 24 August 2000

Tuesday, 3 October 2000

Back to GUIs, Revisited. On to Algorithm Analysis, Continued.

Disclaimer Often, these pages were created "on the fly" with little, if any, proofreading. Any or all of the information on the pages may be incorrect. Please contact me if you notice errors.

This page may be found at

Source text last modified Wed Oct 25 10:05:37 2000.

This page generated on Fri Oct 27 08:19:57 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at