StartGroepenDiscussieVerkennenTijdgeest
Doorzoek de site
Onze site gebruikt cookies om diensten te leveren, prestaties te verbeteren, voor analyse en (indien je niet ingelogd bent) voor advertenties. Door LibraryThing te gebruiken erken je dat je onze Servicevoorwaarden en Privacybeleid gelezen en begrepen hebt. Je gebruik van de site en diensten is onderhevig aan dit beleid en deze voorwaarden.
Hide this

Resultaten uit Google Boeken

Klik op een omslag om naar Google Boeken te gaan.

Bezig met laden...
LedenBesprekingenPopulariteitGemiddelde beoordelingAanhalingen
2,50164,622 (4.28)2
A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.… (meer)
  1. 10
    The Art of Computer Programming, Volumes 1-3 Boxed Set door Donald E. Knuth (billmcn)
    billmcn: The other definitive algorithms textbook, though I like Cormen better because it's shorter and more accessible.
Bezig met laden...

Meld je aan bij LibraryThing om erachter te komen of je dit boek goed zult vinden.

Op dit moment geen Discussie gesprekken over dit boek.

» Zie ook 2 vermeldingen

1-5 van 6 worden getoond (volgende | toon alle)
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. ( )
1 stem jmilloy | 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. ( )
  IvanIdris | 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. ( )
  pammab | 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. ( )
2 stem billmcn | May 28, 2010 |
Deze bespreking is door meerdere gebruikers gemarkeerd als een overtreding van de gebruiksvoorwaarden en wordt daarom niet langer getoond (toon).
  knol | Dec 25, 2009 |
1-5 van 6 worden getoond (volgende | toon alle)
geen besprekingen | voeg een bespreking toe

» Andere auteurs toevoegen (57 mogelijk)

AuteursnaamRolType auteurWerk?Status
Thomas H. Cormenprimaire auteuralle editiesberekend
Leiserson, Charles E.Auteurprimaire auteuralle editiesbevestigd
Rivest, Ronald L.Auteurprimaire auteuralle editiesbevestigd
Stein, Cliffordprimaire auteuralle editiesbevestigd
Je moet ingelogd zijn om Algemene Kennis te mogen bewerken.
Voor meer hulp zie de helppagina Algemene Kennis .
Gangbare titel
Informatie afkomstig uit de Engelse Algemene Kennis. Bewerk om naar jouw taal over te brengen.
Oorspronkelijke titel
Alternatieve titels
Informatie afkomstig uit de Engelse Algemene Kennis. Bewerk om naar jouw taal over te brengen.
Oorspronkelijk jaar van uitgave
Mensen/Personages
Belangrijke plaatsen
Belangrijke gebeurtenissen
Verwante films
Prijzen en eretitels
Motto
Opdracht
Eerste woorden
Informatie afkomstig uit de Engelse Algemene Kennis. Bewerk om naar jouw taal over te brengen.
What are algorithms?
Citaten
Laatste woorden
Ontwarringsbericht
Uitgevers redacteuren
Auteur van flaptekst/aanprijzing
Oorspronkelijke taal
Gangbare DDC/MDS
Canonical LCC
A new edition of the essential text and professional reference, with substantial new material on such topics as vEB trees, multithreaded algorithms, dynamic programming, and edge-based flow.Some books on algorithms are rigorous but incomplete; others cover masses of material but lack rigor. Introduction to Algorithms uniquely combines rigor and comprehensiveness. The book covers a broad range of algorithms in depth, yet makes their design and analysis accessible to all levels of readers. Each chapter is relatively self-contained and can be used as a unit of study. The algorithms are described in English and in a pseudocode designed to be readable by anyone who has done a little programming. The explanations have been kept elementary without sacrificing depth of coverage or mathematical rigor.The first edition became a widely used text in universities worldwide as well as the standard reference for professionals. The second edition featured new chapters on the role of algorithms, probabilistic analysis and randomized algorithms, and linear programming. The third edition has been revised and updated throughout. It includes two completely new chapters, on van Emde Boas trees and multithreaded algorithms, substantial additions to the chapter on recurrence (now called "Divide-and-Conquer"), and an appendix on matrices. It features improved treatment of dynamic programming and greedy algorithms and a new notion of edge-based flow in the material on flow networks. Many new exercises and problems have been added for this edition. The international paperback edition is no longer available; the hardcover is available worldwide.

Geen bibliotheekbeschrijvingen gevonden.

Boekbeschrijving
Haiku samenvatting

Populaire omslagen

Snelkoppelingen

Waardering

Gemiddelde: (4.28)
0.5
1 1
1.5
2 6
2.5
3 32
3.5 1
4 109
4.5 9
5 123

Ben jij dit?

Word een LibraryThing Auteur.

 

Over | Contact | LibraryThing.com | Privacy/Voorwaarden | Help/Veelgestelde vragen | Blog | Winkel | APIs | TinyCat | Nagelaten Bibliotheken | Vroege Recensenten | Algemene kennis | 165,972,029 boeken! | Bovenbalk: Altijd zichtbaar