Introduction to Algorithms
 Cover of the fourth edition | |
| Author | Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein |
|---|---|
| Language | English |
| Subject | Computer algorithms |
| Publisher | MIT Press |
Publication date | 1990 (first edition) |
| Publication place | United States |
| Pages | 1312 |
| ISBN | 978-0-262-04630-5 |
Introduction to Algorithmsis a book on computer programming byThomas H. Cormen,Charles E. Leiserson,Ronald L. Rivest,andClifford Stein.The book has been widely used as thetextbookforalgorithmscoursesat manyuniversities[1]and is commonlycitedas a reference for algorithms in publishedpapers,with over 10,000 citations documented onCiteSeerX,[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 inpseudocode.The descriptions focus on the aspects of the algorithm itself, its mathematical properties, and emphasize efficiency.[7]
Editions[edit]
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 thecoverchanged to green, causing thenicknameto be shortened to just "The Big Book (of Algorithms)."[8]The third edition was published in August 2009. The fourth edition was published in April 2022, which has colors added to improve visual presentations.[9]
Cover design[edit]
Themobiledepicted on the cover,Big Red(1959) byAlexander Calder,can be found at theWhitney Museum of American ArtinNew York City.[10]An Introduction to LanguagebyFromkinalso uses Calder's mobile on its cover.
Publication history[edit]
- Cormen, Thomas H.;Leiserson, Charles E.;Rivest, Ronald L.(1990).Introduction to Algorithms(1st ed.). MIT Press and McGraw-Hill.ISBN0-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.ISBN0-262-03293-7.12 printings up to 2009, errata:[11]
- Cormen, Thomas H.;Leiserson, Charles E.;Rivest, Ronald L.;Stein, Clifford(2009) [1990].Introduction to Algorithms(3rd ed.). MIT Press and McGraw-Hill.ISBN0-262-03384-4.1320 pp., 5 printings up to 2016, errata:[12]
- Cormen, Thomas H.;Leiserson, Charles E.;Rivest, Ronald L.;Stein, Clifford(2022) [1990].Introduction to Algorithms(4th ed.). MIT Press and McGraw-Hill.ISBN0-262-04630-X.1312 pp., errata:[13]
Reviews[edit]
- Akl, Selim G.(1991). "Review of 1st edition".Mathematical Reviews.MR1066870.
- Mann, C. J. H. (April 2003). "New edition of algorithms book [review of 2nd edition]".Kybernetes.32(3).doi:10.1108/k.2003.06732cae.004.
- Thimbleby, Harold(December 3, 2009)."No excuse to be illiterate about IT [review of 3rd edition]".Times Higher Education.
- El-Sharoud, Walid (September 2019)."Review of 3rd edition".Science Progress.102(3): 278–279.doi:10.1177/0036850419873799b.PMC10424523.
See also[edit]
References[edit]
- ^Introduction to Algorithms.MIT Electrical Engineering and Computer Science. MIT Press. 18 June 1990.ISBN978-0-262-03141-7.Retrieved2017-07-02.
- ^"Introduction to Algorithms—CiteSeerX citation query".CiteSeerX.The College of Information Sciences and Technology at Penn State.Retrieved2012-05-15.
- ^"Introduction to Algoritms".Google Scholar.Retrieved2023-11-26.
- ^Larry Hardesty (August 10, 2011)."Milestone for MIT Press's bestseller".MIT News Office.RetrievedAugust 16,2011.
- ^Jane Halpern (February 23, 2022)."Q&A: What makes a bestselling textbook?".MIT News.Massachusetts Institute of Technology.Retrieved26 November2023.
- ^"Eternally Confuzzled - Red/Black Trees".Archived fromthe originalon 2014-11-29.Retrieved2013-07-17.
- ^Cormen; Leiserson; Riverst; Stein (2009). "Preface".Introduction to Algorithms(3 ed.). Cambridge, Massachusetts: MIT Press. pp. xiii–xiv.ISBN978-0-262-03384-8.
- ^"V-Business Card".www.csd.uwo.ca.
- ^Cormen, Thomas H. (22 March 2022).Introduction to Algorithms(4th ed.). MIT Press.ISBN9780262046305.RetrievedAugust 19,2022.
- ^Cormen et al, back cover. See, also,Big Redat the Whitney Museum of American Art web site.
- ^"Introduction to Algorithms, Second Edition".www.cs.dartmouth.edu.
- ^"Introduction to Algorithms, Third Edition".www.cs.dartmouth.edu.
- ^"Errata for Introduction to Algorithms, 4th Edition".mitp-content-server.mit.edu.