Rating:
5/5
Read: 2019-08-30
Review
The comprehensive algorithms textbook. Dense, rigorous, mathematically precise. Used in MIT's algorithms course.
Coverage
- Sorting and order statistics
- Data structures (heaps, hash tables, BSTs)
- Advanced algorithms (graph, dynamic programming, greedy, NP-completeness)
- Advanced data structures (B-trees, Fibonacci heaps)
Not for casual reading, but an essential reference for any computer scientist.