TAOCP Vol 3: Sorting and Searching · Week 99
TAOCP Vol 3 review: reading guide
A review week for Volume 3: sorting and searching.
Time About 6 hours this week
Why it matters
This is the most directly practical volume. Consolidating it gives you a reference you will use for the rest of your career.
Before you start
- All of Vol 3
How to approach it
Gather your implementations (quicksort, heapsort, merge sort, radix sort, BST, AVL, B-tree, hash tables) in one repo with a shared benchmark harness. Write a short decision guide: which sort or search structure when.
Exercises
Redo one sorting analysis from 5.2 from scratch without looking.