词条 | Introduction to Algorithms |
释义 |
|name = Introduction to Algorithms |image = Clrs3.jpeg |caption = Cover of the third edition |author = Thomas H. Cormen Charles E. Leiserson Ronald L. Rivest Clifford Stein |country = {{US}} |language = English |subject = Computer algorithms |publisher = MIT Press |pub_date = 1990 (first edition) |pages = 1312 |isbn = 978-0-262-03384-8 }}Introduction to Algorithms is a book 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] The book sold half a million copies during its first 20 years.[3] 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).[4] 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.[5] EditionsThe 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)."[6] A third edition was published in August 2009. Plans for the next edition started in 2014, but the fourth edition will not be published earlier than 2020. Cover designThe mobile depicted on the cover, Big Red (1959) by Alexander Calder, can be found at the Whitney Museum of American Art in New York City.[7] Table of contents
Publication history
See also
References1. ^{{Cite web|url=https://mitpress.mit.edu/books/introduction-algorithms|title=Introduction to Algorithms|website=MIT Press|language=en-US|access-date=2017-07-02}} 2. ^{{cite web |url=http://citeseerx.ist.psu.edu/showciting?cid=1910 |title=Introduction to Algorithms—CiteSeerX citation query |accessdate=2012-05-15 |work=CiteSeerX |publisher=The College of Information Sciences and Technology at Penn State }} 3. ^{{cite news |url=http://web.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 |accessdate=August 16, 2011}} 4. ^{{cite web|url=http://www.eternallyconfuzzled.com/tuts/datastructures/jsw_tut_rbtree.aspx|title=Eternally Confuzzled - Red/Black Trees}} 5. ^{{Cite book|title=Introduction to Algorithms|last=Cormen|first=|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}} 6. ^{{cite web|url=http://www.csd.uwo.ca/~jamie/.Refs/tech-books.html|title=V-Business Card|website=www.csd.uwo.ca}} 7. ^Cormen et al, back cover. See, also, Big Red at the Whitney Museum of American Art web site. 8. ^{{cite web|url=http://www.cs.dartmouth.edu/~thc/clrs-bugs/bugs-2e.php|title=Introduction to Algorithms, Second Edition|website=www.cs.dartmouth.edu}} 9. ^{{cite web|url=http://www.cs.dartmouth.edu/~thc/clrs-bugs/bugs-3e.php|title=Introduction to Algorithms, Third Edition|website=www.cs.dartmouth.edu}} External links
3 : 1990 books|Computer science books|MIT Press books |
随便看 |
|
开放百科全书收录14589846条英语、德语、日语等多语种百科知识,基本涵盖了大多数领域的百科知识,是一部内容自由、开放的电子版国际百科全书。