I. Foundations. The role of algorithms in computing , Getting started , Growth of functions , Divide-and-conquer , Probabilistic analysis and randomized algorithms ; II. Sorting and order statistics. Heapsort , Quicksort , Sorting in linear time ; Medians and order statistics ; III. Data structures. Elementary data structures , Hash tables , Binary search trees , Red-black trees , Augmenting data structures ; IV. Advanced design and analysis techniques. Dynamic programming , Greedy algorithms , Amortized analysis ; V. Advanced data structures. B-trees , Fibonacci heaps , van Emde Boas trees , Data structures for disjoint sets , VI. Graph algorithms. Elementary graph algorithms , Minimum spanning trees , Single-source shortest paths , All-pairs shortest paths --
Maximun flow ; VII. Selected topics. Multithreaded algorithms , Matrix operations , Linear programming , Polynomials and the FFT , Number-theoretic algorithms , String matching --
Computational geometry , NP-completeness , Approximation algorithms , VIII. Appendix, Mathematical background. Summations , Sets, etc , Counting and probability , Matrices

"As an educator and researcher in the field of algorithms for over two decades, I can unequivocally say that the Cormen et al book is the best textbook that I have ever seen on this subject. It offers an incisive, encyclopedic, and modern treatment of algorithms, and our department will continue to use it for teaching at both the graduate and undergraduate levels, as well as a reliable research reference."--Gabriel Robins, Department of Computer Science, University of Virginia "Introduction to Algorithms, the 'bible' of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance."--Daniel Spielman, Department of Computer Science, Yale University -- Daniel Spielman " Introduction to Algorithms, the "bible" of the field, is a comprehensive textbook covering the full spectrum of modern algorithms: from the fastest algorithms and data structures to polynomial-time algorithms for seemingly intractable problems, from classical algorithms in graph theory to special algorithms for string matching, computational geometry, and number theory. The revised third edition notably adds a chapter on van Emde Boas trees, one of the most useful data structures, and on multithreaded algorithms, a topic of increasing importance." Daniel Spielman , Department of Computer Science, Yale University