FazBrowse Wikipedia Viewer | Main Page |
Search Wikipedia:
|
Viewing: https://en.wikipedia.org/wiki/Introduction_to_Algorithms

Introduction to Algorithms

Contents
See also
References
External links

[[Charles E. Leiserson]]<br />[[Ron Rivest|Ronald L. Rivest]]<br />[[Clifford Stein]]"},"publication_place":{"wt":"[[United States]]"},"language":{"wt":"[[English language|English]]"},"subject":{"wt":"[[Algorithm#Computer algorithms|Computer algorithms]]"},"publisher":{"wt":"[[MIT Press]]"},"publication_date":{"wt":"1990 (first edition)"},"pages":{"wt":"1312"},"isbn":{"wt":"978-0-262-04630-5"}},"i":0}}]}'>
Introduction to Algorithms
Cover of the fourth edition
AuthorThomas H. Cormen
Charles E. Leiserson
Ronald L. Rivest
Clifford Stein
LanguageEnglish
SubjectComputer algorithms
PublisherMIT Press
Publication date1990 (first edition)
Publication placeUnited States
Pages1312
ISBN978-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 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.

Cormen, Thomas H.; Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford (2001) [1990]. Introduction to Algorithms (2nd ed.). MIT Press and McGraw-Hill. ISBN 0-262-03293-7. 12 printings up to 2009, errata:
  • Akl, Selim G. (1991). "Review of 1st edition". Mathematical Reviews. MR 1066870.
  • El-Sharoud, Walid (September 2019). "Review of 3rd edition". Science Progress. 102 (3): 278–279. doi:10.1177/0036850419873799b. PMC 10424523.
  • See also

    edit

    References

    edit
    "Introduction to Algorithms—CiteSeerX citation query". CiteSeerX. The College of Information Sciences and Technology at Penn State. Archived from the original on 2022-08-19. Retrieved 2012-05-15.{{cite web}}: CS1 maint: miscellaneous url (link)
  • ↑ "Eternally Confuzzled - Red/Black Trees". Archived from the original on 2015-02-10. Retrieved 2013-07-17.
  • ↑ Cormen, Thomas H. (22 March 2022). Introduction to Algorithms (4th ed.). MIT Press. ISBN 9780262046305. Retrieved August 19, 2022.
  • ↑ Cormen et al, back cover. See, also, Big Red at the Whitney Museum of American Art web site.
  • ↑ "Errata for Introduction to Algorithms, 4th Edition". mitp-content-server.mit.edu.
  • External links

    edit

    View original on Wikipedia | Back | FazBrowse Home