Reading¶
-
Aho & Ullman: 5.0-5.2, 5.4, 5.6-5.8 [PDF]
- Trees, binary trees, etc.
-
Dasgupta, Papadimitriou, and Vazirani: 2 - Divide-and-conquer algorithms [PDF]
- Multiplication (plus more on Mergesort and Quicksort)
Supplemental¶
- Multiplication: Karatsuba algorithm
- Closest-Pair
-
Goddard: Part A - Divide and Conquer / Sorting and Searching [PDF]
- Convex Hull algorithms (plus more on Mergesort, Quicksort, etc.)
Levitin¶
- Levitin 5.4-5.5 (skip matrix multiplication in 5.4)
- Multiplying large integers; Closest-pair; Convex-hull.