Introduction to Algorithms
Book on computer programming, used as textbook for algorithms courses / From Wikipedia, the free encyclopedia
Dear Wikiwand AI, let's keep it short by simply answering these key questions:
Can you list the top facts and stats about Introduction to Algorithms?
Summarize this article for a 10 year old
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]
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 |
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]