The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical ...
Read More

The updated new edition of the classic Introduction to Algorithms is intended primarily for use in undergraduate or graduate courses in algorithms or data structures. Like the first edition, this text can also be used for self-study by technical professionals since it discusses engineering issues in algorithm design as well as the mathematical aspects. In its new edition, Introduction to Algorithms continues to provide a comprehensive introduction to the modern study of algorithms. The revision has been updated to reflect changes in the years since the book's original publication. New chapters on the role of algorithms in computing and on probabilistic analysis and randomized algorithms have been included. Sections throughout the book have been rewritten for increased clarity, and material has been added wherever a fuller explanation has seemed useful or new information warrants expanded coverage. As in the classic first edition, this new edition of Introduction to Algorithms presents a rich variety of algorithms and covers them in considerable depth while making their design and analysis accessible to all levels of readers. Further, the algorithms are presented in pseudocode to make the book easily accessible to students from all programming language backgrounds. Each chapter presents an algorithm, a design technique, an application area, or a related topic. The chapters are not dependent on one another, so the instructor can organize his or her use of the book in the way that best suits the course's needs. Additionally, the new edition offers a 25% increase over the first edition in the number of problems, giving the book 155 problems and over 900 exercises that reinforcethe concepts the students are learning.
Read Less

Very good. Isbn matches very clean 2nd edition hardcover. no marks clean text solid binding very light wear FAST SHIPPING W/ CONFIRMATION. NO PRIORITY OR INTERNATIONAL ORDERS OVER 4LBs.

I have taught or taken three Algorithms courses from this same text and not covered everything in it. This is a great text for a first introduction into algorithms for undergraduates, a great text for a number of different upper level/graduate courses, and a great reference for the professional.

The subject matter is well chosen, well organized, and extremely well presented. The material is hard. There is no way around the fact that any introduction to algorithms will cause you to stretch your brain, but CLR presents everything in a clear way that you can follow.

The exercises progress from reasonable to very difficult. The more difficult exercises sometime include as much learning as the text. If you ever use this book, go to Cormen's website for an explanation of his bad jokes. This stuff is much easier if you can keep your sense of humor.

Lastly, the pseudo code is presented in a consistent matter as is the nomenclature. Apparently the pseudo code is presented so well that some of the IEEE publications are considering making CLR pseudo code the standard for publication.

If this sounds like a glowing fan letter, it is. Buy this book. Buy it in hard cover because it is NOT going to go out of style.

PS: Buy the third edition. Some chapters are very much clearer than in the second edition. I have both but never even open my second edition.