Book on computer programming, used as textbook for algorithms courses
Introduction to Algorithms
Cover of the fourth edition
Author
Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein
Country
United States
Language
English
Subject
Computer algorithms
Publisher
MIT Press
Publication date
1990 (first edition)
Pages
1312
ISBN
978-0-262-04630-5
Introduction to Algorithms is a book on computer programming 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] and over 67,000 citation on Google Scholar as of 2023.[3] The book sold half a million copies during its first 20 years,[4] and surpassed a million copies sold in 2022.[5] 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).[6]
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.[7]
^Introduction to Algorithms. MIT Electrical Engineering and Computer Science. MIT Press. 18 June 1990. ISBN 978-0-262-03141-7. Retrieved 2017-07-02.
^"Introduction to Algorithms—CiteSeerX citation query". CiteSeerX. The College of Information Sciences and Technology at Penn State. Retrieved 2012-05-15.
^"Introduction to Algoritms". Google Scholar. Retrieved 2023-11-26.
^Larry Hardesty (August 10, 2011). "Milestone for MIT Press's bestseller". MIT News Office. Retrieved August 16, 2011.
^Jane Halpern (February 23, 2022). "Q&A: What makes a bestselling textbook?". MIT News. Massachusetts Institute of Technology. Retrieved 26 November 2023.
^"Eternally Confuzzled - Red/Black Trees". Archived from the original on 2014-11-29. Retrieved 2013-07-17.
^Cormen; Leiserson; Riverst; Stein (2009). "Preface". Introduction to Algorithms (3 ed.). Cambridge, Massachusetts: MIT Press. pp. xiii–xiv. ISBN 978-0-262-03384-8.
and 21 Related for: Introduction to Algorithms information
IntroductiontoAlgorithms is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book...
computation. Algorithms are used as specifications for performing calculations and data processing. More advanced algorithms can use conditionals to divert...
for optimizing the efficiency of other algorithms (such as search and merge algorithms) that require input data to be in sorted lists. Sorting is also often...
Hash Tables, Pat Morin MIT's IntroductiontoAlgorithms: Hashing 1 MIT OCW lecture Video MIT's IntroductiontoAlgorithms: Hashing 2 MIT OCW lecture Video...
science, the analysis of parallel algorithms is the process of finding the computational complexity of algorithms executed in parallel – the amount of...
branch-and-bound algorithm. There are a few variations to the greedy algorithm: Pure greedy algorithms Orthogonal greedy algorithms Relaxed greedy algorithms Greedy...
equivalence of priority queues and sorting algorithms, below, describes how efficient sorting algorithms can create efficient priority queues. There...
analysis of algorithms is the process of finding the computational complexity of algorithms—the amount of time, storage, or other resources needed to execute...
Cormen, Thomas H. (2009). IntroductiontoAlgorithms (3rd ed.). MIT Press. ISBN 978-0-262-03384-8. "Nondeterministic algorithm". National Institute of Standards...
convex hull algorithms can be characterized in terms of both input size n and the output size h (the number of points in the hull). Such algorithms are called...
genetic algorithm (GA) is a metaheuristic inspired by the process of natural selection that belongs to the larger class of evolutionary algorithms (EA)....
this article Master theorem (analysis of algorithms): For analyzing divide-and-conquer recursive algorithms using Big O notation Nachbin's theorem: A...
we shall often use (a, b) to represent a point in the Euclidean plane." Thomas H. Cormen, et al., IntroductiontoAlgorithms (2nd edition, 2001) ISBN 0262032937...
random choices made by the algorithm (Cormen et al., IntroductiontoAlgorithms, Section 7.3). We list here three common proofs to this claim providing different...
hull algorithms is favorable when n is small or h is expected to be very small with respect to n[citation needed]. In general cases, the algorithm is outperformed...
Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001). IntroductiontoAlgorithms (2nd ed.). MIT Press. ISBN 0-262-03293-7. R. A. Frost; M. M. Peterson...
Clifford Stein. IntroductiontoAlgorithms, Second Edition. MIT Press and McGraw-Hill, 2001. ISBN 0-262-03293-7. Section 29.3: The simplex algorithm, pp. 790–804...
L.; Stein, Clifford (2001), "Section 22.4: Topological sort", IntroductiontoAlgorithms (2nd ed.), MIT Press and McGraw-Hill, pp. 549–552, ISBN 0-262-03293-7...
these algorithms are sometimes called sequential coloring algorithms. The maximum (worst) number of colors that can be obtained by the greedy algorithm, by...
which can give it an advantage over algorithms like quicksort . This means that it may outperform those algorithms in cases where the list is already mostly...
Global Information