1. Preface
  2. Notation
  6. Part I: Foundations
  7. Introduction to Algorithms
  8. Analyzing Algorithms
  9. Recursion and Divide-and-Conquer
  11. Part II: Sorting and Selection
  12. Elementary Sorting
  13. Efficient Sorting
  14. Linear-Time Sorting and Selection
  16. Part III: Data Structures
  17. Arrays, Linked Lists, Stacks, and Queues
  18. Hash Tables
  19. Trees and Binary Search Trees
  20. Balanced Search Trees
  21. Heaps and Priority Queues
  23. Part IV: Graph Algorithms
  24. Graphs and Graph Traversal
  25. Shortest Paths
  26. Minimum Spanning Trees
  27. Network Flow
  29. Part V: Algorithm Design Techniques
  30. Dynamic Programming
  31. Greedy Algorithms
  33. Part VI: Advanced Topics
  34. Disjoint Sets
  35. Tries and String Data Structures
  36. String Matching
  37. Complexity Classes and NP-Completeness
  38. Approximation Algorithms
  41. Bibliography