Introduction to Algorithms is a comprehensive and fully understandable introduction to the study of algorithms that makes it suitable for use as a text, handbook or general reference.
Read More
Introduction to Algorithms is a comprehensive and fully understandable introduction to the study of algorithms that makes it suitable for use as a text, handbook or general reference.
Read Less
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. All pages and cover are intact. Possible slightly loose binding, minor highlighting and marginalia, cocked spine or torn dust jacket. Maybe an ex-library copy and not include the accompanying CDs, access codes or other supplemental materials.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. USED US EDITION COLLEGE BOOK-Items do not contain any supplemental materials (access codes or cds) even if listed in the description or title. Books can have stickers, highlighting, writing, or tape (that could be used to mask instruct ed markings). Pages and Cover may have creases or scratches. Consumable items are filled out and completed. We ship out most orders within 1 business day all with Tracking Information.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Very Good. Very Good Condition-May show some limited signs of wear and may have a remainder mark. Pages and dust cover are intact and not marred by notes or highlighting.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Used; Very Good. MIT Press. Used; Very Good. Mit Pr 2009 Hardcover. Pages are clean and unmarked. No dust jacket. There is a small chip missing at top spine. Book Condition: Very Good. 2009. HARDCOVER.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
Good. Item may show signs of shelf wear. Pages may include limited notes and highlighting. May include supplemental or companion materials if applicable. Access codes may or may not work. Connecting readers since 1972. Customer service is our top priority.
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.
