Introduction to Algorithms

Author Cover of the third edition Thomas H. CormenCharles E. LeisersonRonald L. RivestClifford Stein United States English Computer algorithms MIT Press 1990 (first edition) 1312 .mw-parser-output cite.citation{font-style:inherit}.mw-parser-output q{quotes:"\"""\"""'""'"}.mw-parser-output code.cs1-code{color:inherit;background:inherit;border:inherit;padding:inherit}.mw-parser-output .cs1-lock-free a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/6/65/Lock-green.svg/9px-Lock-green.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-limited a,.mw-parser-output .cs1-lock-registration a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/d/d6/Lock-gray-alt-2.svg/9px-Lock-gray-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-lock-subscription a{background:url("//upload.wikimedia.org/wikipedia/commons/thumb/a/aa/Lock-red-alt-2.svg/9px-Lock-red-alt-2.svg.png")no-repeat;background-position:right .1em center}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration{color:#555}.mw-parser-output .cs1-subscription span,.mw-parser-output .cs1-registration span{border-bottom:1px dotted;cursor:help}.mw-parser-output .cs1-hidden-error{display:none;font-size:100%}.mw-parser-output .cs1-visible-error{font-size:100%}.mw-parser-output .cs1-subscription,.mw-parser-output .cs1-registration,.mw-parser-output .cs1-format{font-size:95%}.mw-parser-output .cs1-kern-left,.mw-parser-output .cs1-kern-wl-left{padding-left:0.2em}.mw-parser-output .cs1-kern-right,.mw-parser-output .cs1-kern-wl-right{padding-right:0.2em} 978-0-262-03384-8

Introduction to Algorithms is a book by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book has been widely used as the textbook for algorithms courses at many universities[1] and is commonly cited as a reference for algorithms in published papers, with over 10,000 citations documented on CiteSeerX.[2] The book sold half a million copies during its first 20 years.[3] Its fame has led to the common use of the abbreviation "CLRS" (Cormen, Leiserson, Rivest, Stein), or, in the first edition, "CLR" (Cormen, Leiserson, Rivest).[4]

In the preface, the authors write about how the book was written to be comprehensive and useful in both teaching and professional environments. Each chapter focuses on an algorithm, and discusses its design techniques and areas of application. Instead of using a specific programming language, the algorithms are written in Pseudocode. The descriptions focus on the aspects of the algorithm itself, its mathematical properties, and emphasize efficiency.[5]

Editions

The first edition of the textbook did not include Stein as an author, and thus the book became known by the initialism CLR. It included two chapters ("Arithmetic Circuits" & "Algorithms for Parallel Computers") that were dropped in the second edition. After the addition of the fourth author in the second edition, many began to refer to the book as "CLRS". This first edition of the book was also known as "The Big White Book (of Algorithms)." With the second edition, the predominant color of the cover changed to green, causing the nickname to be shortened to just "The Big Book (of Algorithms)."[6] A third edition was published in August 2009. Plans for the next edition started in 2014, but the fourth edition will be published in 2019 the earliest, and likely later than that.[7]

Cover design

The mobile depicted on the cover, Big Red (1959) by Alexander Calder, can be found at the Whitney Museum of American Art in New York City.[8]

• I Foundations
• 1 The Role of Algorithms in Computing
• 2 Getting Started
• 3 Growth of Function
• 4 Divide-and-Conquer
• 5 Probabilistic Analysis and Randomized Algorithms
• II Sorting and Order Statistics
• 6 Heapsort
• 7 Quicksort
• 8 Sorting in Linear Time
• 9 Medians and Order Statistics
• III Data Structures
• 10 Elementary Data Structures
• 11 Hash Tables
• 12 Binary Search Trees
• 13 Red-Black Trees
• 14 Augmenting Data Structures
• IV Advanced Design and Analysis Techniques
• 15 Dynamic Programming
• 16 Greedy Algorithms
• 17 Amortized Analysis
• 18 B-Trees
• 19 Fibonacci Heap
• 20 Van Emde Boas Trees
• 21 Data Structures for Disjoint Sets
• VI Graph Algorithms
• 22 Elementary Graph Algorithms
• 23 Minimum Spanning Trees
• 24 Single-Source Shortest Paths
• 25 All-Pairs Shortest Paths
• 26 Maximum Flow
• VII Selected Topics
• 28 Matrix Operations
• 29 Linear Programming
• 30 Polynomials and the FFT
• 31 Number-Theoretic Algorithms
• 32 String Matching
• 33 Computational Geometry
• 34 NP-Completeness
• 35 Approximation Algorithms
• VIII Appendix: Mathematical Background
• A Summations
• B Sets, Etc.
• C Counting and Probability
• D Matrices

Publication history

• Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L. (1990). Introduction to Algorithms (1st ed.). MIT Press and McGraw-Hill. ISBN 0-262-03141-8.
• Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001) [1990]. Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03293-7. 12 printings up to 2009, errata:[9]
• Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2009) [1990]. Introduction to Algorithms (3rd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03384-4. 5 printings up to 2016), errata:[10]

References

1. "Introduction to Algorithms". MIT Press. Retrieved 2017-07-02.
2. "Introduction to AlgorithmsCiteSeerX citation query". CiteSeerX. The College of Information Sciences and Technology at Penn State. Retrieved 2012-05-15.
3. Larry Hardesty (August 10, 2011). "Milestone for MIT Press's bestseller". MIT News Office. Retrieved August 16, 2011.
4. "Eternally Confuzzled - Red/Black Trees".
5. Cormen; Leiserson; Riverst; Stein (2009). "Preface". Introduction to Algorithms (3 ed.). Cambridge, Massachusetts: MIT Press. pp. xiii–xiv. ISBN 978-0-262-03384-8.