Introduction to Algorithms
Introduction to Algorithms is a book on computer programming. It came out in 1990. It was written by Thomas H. Cormen, Charles E. Leiserson and Ron Rivest.
- Published
- 1990
- Written by
- Thomas H. Cormen
- Genre
- textbook
- Country of origin
- United States
All 10 facts, and where they come from
Facts
10 facts · 0 confirmed by two sources · 1 cited · 9 from one source
Where this comes from
Papalocal keeps its own record. It started from these sources; what each one said is kept here as it was copied, so a change on their side never changes this page by itself. Tap one to read its version.
What Wikidata says · copied November 17, 2026 · revision 2471546474
- Described as
- book on computer programming
- Other names
- CLRS, CLR
- What it is
- written work
- Written by
- Thomas H. Cormen; Charles E. Leiserson; Ron Rivest; Clifford Stein
- Genre
- textbook
- Published
- 2009; 1990 · 1 reference
- Language
- English
- Country of origin
- United States · 1 reference
- Official website
- http://mitpress.mit.edu/algorithms
- Wikipedias with a page
- 13
Wikidata item Q1141518 (wikidata.org/wiki/Q1141518), public domain (CC0). Copied 2026-11-17.
What Wikipedia says · copied November 17, 2026 · revision 1384254598
Introduction to Algorithms is a book on computer programming by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. The book is described by its publisher as "the leading algorithms text in universities worldwide as well as the standard reference for professionals". It is commonly cited as a reference for algorithms in published papers, with over 10,000 citations documented on CiteSeerX, and over 70,000 citations on Google Scholar as of 2024. The book sold half a million copies during its first 20 years, and surpassed a million copies sold in 2022. 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).
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.
From the Wikipedia article “Introduction to Algorithms” (en.wikipedia.org/wiki/Introduction_to_Algorithms), by its contributors, under CC BY-SA 4.0 (creativecommons.org/licenses/by-sa/4.0/). Copied 2026-11-17; not changed.
Confirmed Two sources agree. Cited One source, and it names where it got it. One source One source, without a reference of its own. Sources disagree The sources disagree. We show the best-supported value and keep theirs below.
