Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Scribd
Upload
25 views

Introduction To Algorithms

This document provides information about the book "Introduction to Algorithms" by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. It is widely used as a textbook for algorithms courses and is cited frequently in published papers. The book has sold over a million copies and explains algorithms through pseudocode rather than a specific programming language. It focuses on the mathematical properties and efficiency of the algorithms. There have been multiple editions of the book with some changes to content and additional authors.

Uploaded by

jeepjeep
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
25 views

Introduction To Algorithms

This document provides information about the book "Introduction to Algorithms" by Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, and Clifford Stein. It is widely used as a textbook for algorithms courses and is cited frequently in published papers. The book has sold over a million copies and explains algorithms through pseudocode rather than a specific programming language. It focuses on the mathematical properties and efficiency of the algorithms. There have been multiple editions of the book with some changes to content and additional authors.

Uploaded by

jeepjeep
Copyright
© © All Rights Reserved
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 3

Introduction to Algorithms

12 languages
 Article
 Talk
 Read
 Edit
 View history
Tools












From Wikipedia, the free encyclopedia

Introduction to Algorithms
Cover of the fourth edition

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

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]
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]
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 cover changed to
green, causing the nickname to be shortened to just "The Big Book (of
Algorithms)."[8] The third edition was published in August 2009. The f

You might also like