Introduction to Algorithms, Second Edition

Leiserson, Charles E.; Rivest, Ronald L.; Stein, Clifford

ISBN 10: 0262032937 / ISBN 13: 9780262032933

Editore: Mit Pr, 2001

Riguardo questo articolo

Supports Goodwill of Silicon Valley job training programs. The cover and pages are in Acceptable condition! Any other included accessories are also in Acceptable condition showing use. Use can include some highlighting and writing, page and cover creases as well as other types visible wear such as cover tears discoloration, staining, marks, scuffs, etc. All pages intact.

Codice articolo GWSVV.0262032937.A

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