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


Class 20: Algorithm Analysis

Back to Discussion of Exam 1 and Project. On to Recursion.

Held Wednesday, September 29, 1999

Overview

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 a collection.

Notes

Contents

Handouts

Summary


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


History

Tuesday, 10 August 1999

Monday, 27 September 1999

Tuesday, 28 September 1999

Wednesday, 29 September 1999

Back to Discussion of Exam 1 and Project. On to Recursion.


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 http://www.math.grin.edu/~rebelsky/Courses/CS152/99F/Outlines/outline.20.html

Source text last modified Wed Sep 29 09:42:18 1999.

This page generated on Wed Sep 29 09:42:44 1999 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu