|
}}
'''''Introduction to Algorithms''''' is a book on computer programming by [[Thomas H. Cormen]], [[Charles E. Leiserson]], [[Ron Rivest|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".<ref>{{Cite web |title=Introduction to Algorithms, fourth edition |url=https://mitpress.mit.edu/9780262046305/introduction-to-algorithms/ |access-date=2024-11-04 |website=MIT Press |language=en-US}}</ref> It is commonly [[Citation|cited]] as a reference for algorithms in published [[Academic publishing#Scholarly paper|papers]], with over 10,000 citations documented on [[CiteSeerX]],<ref>{{cite web |url=httphttps://citeseerx.ist.psu.edu/showciting?cid=1910 |title=Introduction to Algorithms—CiteSeerX citation query |access-date=2012-05-15 |work=[[CiteSeerX]] |publisher=The College of Information Sciences and Technology at Penn State |archive-url=https://web.archive.org/web/20220819003324/https://citeseerx.ist.psu.edu/showciting?cid=1910 |archive-date=2022-08-19 |url-status=dead }}</ref> and over 6770,000 citations on Google Scholar as of 20232024.<ref>{{Cite web |url=https://scholar.google.com/scholarcitations?citesview_op=13113538517800069442view_citation&hl=en&user=V5FJ6pIAAAAJ&citation_for_view=V5FJ6pIAAAAJ:u5HHmVD_uO8C |title=Introduction to Algorithms |access-date=20232024-1112-2613 |website=Google Scholar}}</ref> The book sold half a million copies during its first 20 years,<ref>{{cite news |url=httphttps://webnews.mit.edu/newsoffice/2011/introduction-to-algorithms-500k-0810.html |title=Milestone for MIT Press's bestseller |author=Larry Hardesty |date=August 10, 2011 |publisher=MIT News Office |access-date=August 16, 20112024-11-26}}</ref> and surpassed a million copies sold in 2022.<ref>{{cite web |title=Q&A: What makes a bestselling textbook? |author=Jane Halpern |date=February 23, 2022 |url=https://news.mit.edu/2022/qa-what-makes-bestselling-textbook-introduction-algorithms-0223 |website=MIT News |publisher=Massachusetts Institute of Technology |access-date=26 November 2023}}</ref> 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).<ref>{{cite web |url=http://www.eternallyconfuzzled.com/tuts/datastructures/jsw_tut_rbtree.aspx |title=Eternally Confuzzled - Red/Black Trees |access-date=2013-07-17 |archive-url=https://web.archive.org/web/2014112902431220150210154825/http://www.eternallyconfuzzled.com/tuts/datastructures/jsw_tut_rbtree.aspx |archive-date=20142015-1102-2910 |url-status=dead}}</ref>
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.<ref>{{Cite book |title=Introduction to Algorithms |last1=Cormen |last2=Leiserson |last3=Riverst |last4=Stein |publisher=MIT Press |year=2009 |isbn=978-0-262-03384-8 |edition=3 |___location=Cambridge, Massachusetts |pages=xiii-xiv |chapter=Preface}}</ref>
==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 [[Book cover|cover]] changed to green, causing the [[nickname]] to be shortened to just "The Big Book (of Algorithms)."<ref>{{cite web |url=httphttps://wwwweb.csdcs.uwodal.ca/~jamie/UWO/.Refs/tech-books.html |title=V-BusinessSome CardUseful Technical Books |website=wwwweb.csdcs.uwodal.ca}}</ref> The third edition was published in August 2009. The fourth edition was published in April 2022, which has colors added to improve visual presentations.<ref>{{Cite book |last=Cormen |first=Thomas H. |url=https://mitpress.mit.edu/books/introduction-algorithms-fourth-edition |title=Introduction to Algorithms |date=22 March 2022 |publisher=MIT Press |isbn=9780262046305 |edition=4th |language=en-US |access-date=August 19, 2022 }}</ref>
==Cover design==
==Publication history==
* {{Introduction to Algorithms|1|notitlelink=1}}
* {{Introduction to Algorithms|2|notitlelink=1}} 12 printings up to 2009, errata:<ref>{{cite web |url=httphttps://www.cs.dartmouth.edu/~thc/clrs-bugs/bugs-2e.php |title=Introduction to Algorithms, Second Edition |website=www.cs.dartmouth.edu}}</ref>
* {{Introduction to Algorithms|3|notitlelink=1}} 1320 pp., 5 printings up to 2016, errata:<ref>{{cite web |url=httphttps://www.cs.dartmouth.edu/~thc/clrs-bugs/bugs-3e.php |title=Introduction to Algorithms, Third Edition |website=www.cs.dartmouth.edu}}</ref>
* {{Introduction to Algorithms|4|notitlelink=1}} 1312 pp., errata:<ref>{{cite web |title=Errata for Introduction to Algorithms, 4th Edition |url=https://mitp-content-server.mit.edu/books/content/sectbyfn/books_pres_0/11599/e4-bugs.html |website=mitp-content-server.mit.edu}}</ref>
| newspaper = Times Higher Education
| title = No excuse to be illiterate about IT [review of 3rd edition]
| url = https://www.timeshighereducation.co.ukcom/books/textbook-guides/8-november-2012/introduction-to-algorithms/story.asp?sectioncode=26&storycode=409350.article}}
*{{cite journal
| last = El-Sharoud | first = Walid
==External links==
* {{Official website|httphttps://mitpress.mit.edu/9780262046305/introduction-to-algorithms}} on [[MIT Press]]
[[Category:1990 non-fiction books]]
| 