Chapter2 - Getting Started
Chapter4 - Divide-and-Conquer
Chapter5 -Probabilistic Analysis and Randomized Algorithms
Chapter6 - Heapsort
Chapter7 - Quicksort
Chapter8 - Sorting in Linear Time
Chapter9 - Medians and Order Statistics
Chapter10 - Elementary Data Structures
Chapter11 - Hash Tables
Chapter12 - Binary Search Trees
Chapter13 - Red-Black Trees
Chapter14 - Elementary Data Structures
Chapter15 - Dynamic Programming
Chapter16 - Greedy Algorithms