Sorting & Searching
A 14-module path through sorting & searching, in study order from foundations to the frontier.
Modules
- Insertion Sort
- Selection Sort
- Divide-and-Conquer and Recurrences
- Merge Sort
- Quicksort and Partitioning
- Pivot Strategies and Randomized Quicksort
- Binary Heaps
- Heapsort
- The Comparison-Sort Lower Bound
- Counting Sort
- Radix Sort
- Bucket Sort
- Binary Search and Interpolation Search
- Order Statistics and Linear-Time Selection