![](https://image.librarything.com/pics/fugue21/magnifier-left.png)
![Introduction to Algorithms (Eastern Economy…](https://images-na.ssl-images-amazon.com/images/P/8120340078.01._SX180_SCLZZZZZZZ_.jpg)
Cliquer sur une vignette pour aller sur Google Books.
Chargement... Introduction to Algorithms (Eastern Economy Edition) (édition 2010)par Thomas H. Cormen (Auteur)
Information sur l'oeuvreIntroduction à l'algorithmique par Thomas H. Cormen
![]()
Actuellement, il n'y a pas de discussions au sujet de ce livre. 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. aucune critique | ajouter une critique
Appartient à la série
Références à cette œuvre sur des ressources externes.
|
Discussion en coursAucunCouvertures populaires
![]() GenresClassification décimale de Melvil (CDD)005.1Information Computer Science; Knowledge and Systems Computer programming, programs, data, security ProgrammingClassification de la Bibliothèque du CongrèsÉvaluationMoyenne:![]()
Est-ce vous ?Devenez un(e) auteur LibraryThing. |
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. (