Introduction to Algorithms - 2nd Edition
|
|
| Customers who bought this, also bought: |
|---|
| WHS: A Management Guide, 3rd Edition |
| Australian Taxation Law 2012 - 22nd Edition |
| Business Statistics - Abridged: Australia New Zealand Edition, 5th Edition |
| Teaching Primary Science Constructively, 4th Edition |
| Company Accounting: Prepare Financial Reports for a Reporting Entity, 2nd Edition |
| Financial Accounting: A Practical Approach, 3rd Edition |
| Australian Business Law + 2011 Update, 6th Edition (For the new 7th edition, please perform a new search using the following ISBN: 9781442537859) |
| Accounting: An Introduction to Principles and Practice, 6th Edition + Accounting: An Introduction to Principles and Practice Workbook (This is an OLD EDITION. For the new edition, please use ISBN: 9780170165570) |
| C++ Primer Plus (5th Edition) |
| Australian Master Bookkeepers Guide 2010/11 - 3rd Edition |
|
by:
Thomas H Cormen, Charles E Leiserson, Robert L Rivest & Clifford Stein
|
On-line Price:
$84.00 (includes GST)
Paperback package 1184
13%Off Retail Price
You
save: $13.00
Usually ships in 2-3 weeks
|
Retail Price:
$97.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.
|
