Topics for MT2 (written on 2005-04-06)

Recurrence relations (Ch. 2, Appendix B, and elsewhere)
Sums (Ch.2 and Appendix B)

Topics from Ch.3 (Brute Force):
Selection Sort and Bubble Sort (3.1)
Sequential Search and Brute-Force String Matching (3.2)
Closest-Pair Problem by Brute Force (parts of 3.3)

Topics from Ch. 4 (Divide-and-Conquer):
The master recurrence and its solution
Mergesort (4.1)
Quicksort (4.2)
Binary Search (4.3)
Strassen's Algorithm (4.5)
Quickhull (parts of 4.6)

Topics from Ch. 6 (Transform-and-Conquer):
Heaps and Heapsort (6.4)
Horner's Rule (parts of 6.5)

Topics from Ch. 8 (Dynamic Programming):
All, except memory functions in 8.4.

Topics from Ch. 9 (Greedy Technique):
All.