Introduction to Algorithms, Second Edition
ISBN-13:
9780262032933
ISBN-10:
0262032937
Edition:
2nd
Author:
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Publication date:
2001
Publisher:
Mit Pr
Format:
Hardcover
1184 pages
Category:
Computer Science
,
Algorithms
,
Programming
,
Mathematics
FREE US shipping
Book details
ISBN-13:
9780262032933
ISBN-10:
0262032937
Edition:
2nd
Author:
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Publication date:
2001
Publisher:
Mit Pr
Format:
Hardcover
1184 pages
Category:
Computer Science
,
Algorithms
,
Programming
,
Mathematics
Summary
Introduction to Algorithms, Second Edition (ISBN-13: 9780262032933 and ISBN-10: 0262032937), written by authors
Thomas H. Cormen, Charles E. Leiserson, Ronald L. Rivest, Clifford Stein, was published by Mit Pr in 2001.
With an overall rating of 3.7 stars, it's a notable title among other
Computer Science
(Algorithms, Programming, Mathematics) books. You can easily purchase or rent Introduction to Algorithms, Second Edition (Hardcover) from BooksRun,
along with many other new and used
Computer Science
books
and textbooks.
And, if you're looking to sell your copy, our current buyback offer is $0.35.
Description
The first edition won the award for Best 1990 Professional and Scholarly Book in Computer Science and Data Processing by the Association of American Publishers.
There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness.
The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.
There are books on algorithms that are rigorous but incomplete and others that cover masses of material but lack rigor. Introduction to Algorithms combines rigor and comprehensiveness.
The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.
The first edition became the standard reference for professionals and a widely used text in universities worldwide. The second edition features new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming, as well as extensive revisions to virtually every section of the book. In a subtle but important change, loop invariants are introduced early and used throughout the text to prove algorithm correctness. Without changing the mathematical and analytic focus, the authors have moved much of the mathematical foundations material from Part I to an appendix and have included additional motivational material at the beginning.
We would LOVE it if you could help us and other readers by reviewing the book
Book review
Congratulations! We have received your book review.
{user}
{createdAt}
by {truncated_author}