An Algorithmic and Social Introduction to Computer Science (CSC-105 2000S)


Class 09: Analyzing Algorithms

Back to The Parts of an Algorithm. On to Sorting.

Held Monday, February 7, 2000

Overview

Today we consider ways in which one might choose between different algorithms that purport to solve the same problem. We look at a mathematical notation, Big O, that lets us describe the space or time requirements of an algorithm.

Question 9 for today: Suppose you've been given two sets of instructions that solve the same problem. What criteria might you use to determine whether one is better than the other?

Question 10 for Tuesday: Describe how to put a pile of books in alphabetical order by author.

Notes

Contents

Summary


Three Smallest Algorithms

Choosing Between The Algorithms

Evaluating Algorithms

Big O Notation

Searching


History

Saturday, 22 January 2000

Monday, 7 February 2000

Back to The Parts of an Algorithm. On to Sorting.


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/CS105/2000S/Outlines/outline.09.html

Source text last modified Mon Feb 7 09:30:25 2000.

This page generated on Mon Feb 7 09:29:51 2000 by Siteweaver. Validate this page's HTML.

Contact our webmaster at rebelsky@grinnell.edu