Goals of the Lecture of September 15 2005

1. The student will be familiar with the concept of "divide and conquer"
algorithms.

2. The student will master the technique of writing a recurrence relation
to analyze the time complexity of a divide and conquer algorithm.

3. The student will be familiar with certain standard divide and conquer
algorithms, including binary search, mergesort, and quicksort.