Afbeelding van de auteur.

Thomas H. Cormen

Auteur van Introduction to Algorithms

5 Werken 2,909 Leden 6 Besprekingen

Over de Auteur

Thomas H. Cormen received a Ph. D. from MIT in 1992. He is an associate professor at Dartmouth College. Cormen is one of the authors of Introduction to Algorithms. (Bowker Author Biography)

Werken van Thomas H. Cormen

Introduction to Algorithms (1990) 2,761 exemplaren
Algorytmy bez tajemnic (2021) 1 exemplaar
算法导论 1 exemplaar

Tagged

Algemene kennis

Leden

Besprekingen

apparently the second most cited computer science book, and for good reason. (no, i don't know the top most cited, and no, its not knuth). but, what a vast and exciting array of pseudocode, algorithms, and their data structures! good largley for being rich and dense, but readable. doesn't waste space over explaining, but should be sufficient for most anyone with a active interest.

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.
… (meer)
1 stem
Gemarkeerd
jmilloy | 5 andere besprekingen | Nov 8, 2017 |
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.
 
Gemarkeerd
IvanIdris | 5 andere besprekingen | Dec 26, 2011 |
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.
 
Gemarkeerd
pammab | 5 andere besprekingen | Dec 15, 2011 |
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.… (meer)
2 stem
Gemarkeerd
billmcn | 5 andere besprekingen | May 28, 2010 |

Lijsten

Misschien vindt je deze ook leuk

Gerelateerde auteurs

Statistieken

Werken
5
Leden
2,909
Populariteit
#8,803
Waardering
½ 4.3
Besprekingen
6
ISBNs
57
Talen
10

Tabellen & Grafieken