|
|
|
|
|
|
|
HELP | |
|
  $60.00 List price:
HARDCOVER, USED
Ships in 1 to 3 days
More copies of this ISBN:This title in other formats:Introduction To Algorithms 2ND Editionby Thomas H Cormen
Synopses & ReviewsPublisher Comments: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. Review:Both rigorous and complete, this introduction covers traditional material and modern developments: elementary data structures, sorting graph algorithms and NP-completeness are included along with material on Fibonacci heaps, parallel algorithms, network flow algorithms, computational geometry, and number-theoretic algorithms. Annotation copyright Book News, Inc. Portland, Or. Synopsis:An extensively revised edition of a mathematically rigorous yet accessible introduction to algorithms. Synopsis:This title 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. About the AuthorThomas H. Cormen is Associate Professor of Computer Science at Dartmouth College.Charles E. Leiserson is Professor of Computer Science and Engineering at the Massachusetts Institute of Technology.Ronald L. Rivest is Andrew and Erna Viterbi Professor of Computer Science at the Massachusetts Institute of Technology.Clifford Stein is Associate Professor of Industrial Engineering and Operations Research at Columbia University. What Our Readers Are SayingAdd a comment for a chance to win!
Average customer rating based on 1 comment: | ||||||||||||
|
| |||||||||||||
|
|||||||||||||
Don't Miss
