Introduction to Algorithms - 2nd Edition

Customers who bought this, also bought: The C++ Standard : Incorporating Technical Corrigendum No. 1 MORE Effective C++ - 35 New Ways to Improve Your Programs & Designs (Addison-Wesley Professional Computing Series) C++ Standard Library: A Tutorial and Reference The Elements of Statistical Learning (Hardcover) The Art of Computer Programming, Volume 1-3 Boxed Set, 2nd Edition Visual Display of Quantitative Information - 2nd Edition The C Standard Database Systems: The Complete Book, 2nd Edition C++ Programming Language, Special Edition (Hardback) Effective STL: 50 Specific Ways to Improve Your Use of the Standard Template Library (Addison-Wesley Professional Computing Series)

by: Thomas H Cormen, Charles E Leiserson, Robert L Rivest & Clifford Stein

Notify me when in stock

On-line Price: $86.00 (includes GST) Paperback package 1184 13%Off Retail Price You save: $13.00 Usually Ships within 2-3 weeks. Prices can change...but we will email you and ask for your direction where there is an increase.	Retail Price: $99.00 Publisher: MIT PRESS,1.9.2001 Category: DATA STRUCTURES Level: I/A ISBN: 0262531968 ISBN13: 9780262531962
Add to Shopping Cart

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.