Computer Science
Introduction to Algorithms
Publisher: MIT Press, 2003, 1056pp, 2nd ed.
Both rigorous and complete, Cormen's introductory textbook covers traditional material and modern developments: elementary data structures, sorting graph algorithms and NP-completeness are included along with material on Fibonacci heaps, parallel algorithms, network flow algorithms, computational geometry, and number-theoretic algorithms.
Table of contents
| Preface | xiii | |
| Foundations | ||
| Introduction | 3 | |
| The Role of Algorithms in Computing | 5 | |
| Getting Started | 15 | |
| Growth of Functions | 41 | |
| Recurrences | 62 | |
| Probabilistic Analysis and Randomized Algorithms | 91 | |
| Sorting and Order Statistics | ||
| Introduction | 123 | |
| Heapsort | 127 | |
| Quicksort | 145 | |
| Sorting in Linear Time | 165 | |
| Medians and Order Statistics | 183 | |
| Data Structures | ||
| Introduction | 197 | |
| Elementary Data Structures | 200 | |
| Hash Tables | 221 | |
| Binary Search Trees | 253 | |
| Red-Black Trees | 273 | |
| Augmenting Data Structures | 302 | |
| Advanced Design and Analysis Techniques | ||
| Introduction | 321 | |
| Dynamic Programming | 323 | |
| Greedy Algorithms | 370 | |
| Amortized Analysis | 405 | |
| Advanced Data Structures | ||
| Introduction | 431 | |
| B-Trees | 434 | |
| Binomial Heaps | 455 | |
| Fibonacci Heaps | 476 | |
| Data Structures for Disjoint Sets | 498 | |
| Graph Algorithms | ||
| Introduction | 525 | |
| Elementary Graph Algorithms | 527 | |
| Minimum Spanning Trees | 561 | |
| Single-Source Shortest Paths | 580 | |
| All-Pairs Shortest Paths | 620 | |
| Maximum Flow | 643 | |
| Selected Topics | ||
| Introduction | 701 | |
| Sorting Networks | 704 | |
| Matrix Operations | 725 | |
| Linear Programming | 770 | |
| Polynomials and the FFT | 822 | |
| Number-Theoretic Algorithms | 849 | |
| String Matching | 906 | |
| Computational Geometry | 933 | |
| NP-Completeness | 966 | |
| Approximation Algorithms | 1022 | |
| Appendix: Mathematical Background | ||
| Introduction | 1057 | |
| Summations | 1058 | |
| Sets, Etc. | 1070 | |
| Counting and Probability | 1094 | |
