Study Guide 
Tucker: Applied Combinatorics 
§3.4 Tree Analysis of Sorting Algorithms
Dr. Lee Eimers
Revised 11-07-07

Introduction:  Here we apply some of the material to one of the basic processes in computer science, that of sorting a list of data.

Concepts and Vocabulary:
The following boldfaced (or italic) terms and phrases introduced in this section.
Bubble sort
Heap sort 		Merge sort
QUIK sort
Points of Interest:

1.  The one theorem in this section is very important.  Be sure you understand the reasoning that underlies the proof of the theorem.

2.  You should be able to do any of the four sorts listed above for a simple set of unsorted items (usually numbers)

Homework Assignment:
Do to hand in: #1,2,4,8
Thought for the Day
Yesterday I was a dog.
Today I am a dog.
Tomorrow I'll probably still be a dog.
-- Snoopy --