Introduction to Algorithms, Second Edition

Cormen, Thomas H., Leiserson, Charles E., Rivest, Ronald L., Stein, Clifford

ISBN 10: 0262032937 / ISBN 13: 9780262032933

Editore: Mit Pr, 2001

Riguardo questo articolo

LIGHTNING FAST SHIPPING! A heavily used, but still working copy. Coffee stain and wrinkling to the edge of the pages when a tired undergrad fell asleep and knocked their cup over on their books. The binding and pages of the book have been reinforced with tape, has tape and stickers on the cover, as well as lots of notes (some of the answers in the learning activities may be filled in) on the pages. Definitely not pretty, but it's a working copy at a great price that ships fast. ~ Book does NOT contain an access code or CD/DVD.

Codice articolo #148B-0124

Dati bibliografici

• Titolo: Introduction to Algorithms, Second Edition
• Editore: Mit Pr
• Data di pubblicazione: 2001
• Lingua: Inglese
• ISBN 10: 0262032937
• ISBN 13: 9780262032933
• Rilegatura: Rilegato
• Edizione: seconda edizione
• Condizione: Acceptable

Descrizione articolo

Riassunto

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.

Product Description

Book by Cormen Thomas H Leiserson Charles E Rivest Ronald