Introduction to Algorithms, Third Edition
- 24h 50m
- Charles E. Leiserson, Clifford Stein, Ronald L. Rivest, Thomas H. Cormen
- The MIT Press
- 2009
Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor. The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. As of the third edition, this textbook is published exclusively by the MIT Press.
About the Authors
Thomas H. Cormen is Professor of Computer Science and former Director of the Institute for Writing and Rhetoric at Dartmouth College. He is the coauthor (with Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein) of the leading textbook on computer algorithms, Introduction to Algorithms (third edition, MIT Press, 2009).
Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.
Ronald L. Rivest is Andrew and Erna Viterbi Professor of Electrical Engineering and Computer Science at the Massachusetts Institute of Technology.
Clifford Stein is Professor of Industrial Engineering and Operations Research at Columbia University.
In this Book
-
The Role of Algorithms in Computing
-
Getting Started
-
Growth of Functions
-
Divide-and-Conquer
-
Probabilistic Analysis and Randomized Algorithms
-
Heapsort
-
Quicksort
-
Sorting in Linear Time
-
Medians and Order Statistics
-
Elementary Data Structures
-
Hash Tables
-
Binary Search Trees
-
Red-Black Trees
-
Augmenting Data Structures
-
Dynamic Programming
-
Greedy Algorithms
-
Amortized Analysis
-
B-Trees
-
Fibonacci Heaps
-
van Emde Boas Trees
-
Data Structures for Disjoint Sets
-
Elementary Graph Algorithms
-
Minimum Spanning Trees
-
Single-Source Shortest Paths
-
All-Pairs Shortest Paths
-
Maximum Flow
-
Multithreaded Algorithms
-
Matrix Operations
-
Linear Programming
-
Polynomials and the FFT
-
Number-Theoretic Algorithms
-
String Matching
-
Computational Geometry
-
NP-Completeness
-
Approximation Algorithms
