This site uses cookies to deliver our services, improve performance, for analytics, and (if not signed in) for advertising. By using LibraryThing you acknowledge that you have read and understand our Terms of Service and Privacy Policy. Your use of the site and services is subject to these policies and terms.

Loading... ## Introduction to Algorithms, 3rd Edition (MIT Press) (edition 2009)## by Thomas H. Cormen (Author)
## Work detailsIntroduction to Algorithms by Thomas H. Cormen
- 10The Art of Computer Programming, Volumes 1-3 Boxed Set by Donald E. Knuth (billmcn)
billmcn: The other definitive algorithms textbook, though I like Cormen better because it's shorter and more accessible.
None Loading...
Sign up for LibraryThing to find out whether you'll like this book. No current Talk conversations about this book. This book is like an encyclopedia of algorithms. The algorithms are presented with pseudo code so it doesn’t matter what your favorite programming language is. A very rigorous mathematical approach is used for the analysis of for instance performance. Normally I wouldn't review a textbook, but reading this one is enjoyable.It's one of the very best textbooks I've ever used. Unbelievably well written. Well organized. Great examples and pictures. Clearly explained proofs. It is easy to read and learn from. I'm surprised I was able to get an already-used copy of this book; I'll be keeping mine for a very long time. The definitive graduate or upper-level undergraduate computer science textbook. This is the place to go to learn basic algorithms, data structures, proofs of correctness, and big-O notation. I prefer it to Knuth's three-volume opus, because it's shorter and doesn't get bogged down in the details of an artificial assembly language. Cormen et al. also makes for a fine self-study guide. If you're reading it on your own, check out the MIT Open Course Introduction to Algorithms class, which has a full set of online lectures and problem sets based on this book. no reviews | add a review
References to this work on external resources. ## Wikipedia in English (53)No library descriptions found. |
Google Books — Loading... ## Popular covers## RatingAverage:
## Is this you?Become a LibraryThing Author. |

an interesting feature, with respect to the exercises and especially problems for each chapter, is that i think cormen subscribes to a methodology where the solution to a problem should often require information or intuition not found in the chapter, nor even necessarily in the preceding chapters. you find yourself driving towards solutions that are used in later sections, or revisiting old problems once you find a better solution later on.

and, of course, cormen is here at dartmouth. one should probably always have a copy handy when writing code. ( )