HemGrupperDiskuteraMerTidsandan
Känner du till SantaThing, LibraryThings julklappsbyte?
avfärda
Denna webbplats använder kakor för att fungera optimalt, analysera användarbeteende och för att visa reklam (om du inte är inloggad). Genom att använda LibraryThing intygar du att du har läst och förstått våra Regler och integritetspolicy. All användning av denna webbplats lyder under dessa regler.
Hide this

Resultat från Google Book Search

Klicka på en bild för att gå till Google Book Search.

Introduction to Algorithms av Thomas H.…
Laddar...
MedlemmarRecensionerPopularitetGenomsnittligt betygOmnämnanden
2,37164,526 (4.27)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.… (mer)
Medlem:NesreenZiedan
Titel:Introduction to Algorithms
Författare:Thomas H. Cormen
Andra författare:Charles E. Leiserson, Ronald L. Rivest, Clifford Stein
Info:The MIT Press (2009), Edition: third edition, Hardcover, 1312 pages
Samlingar:Ditt bibliotek
Betyg:
Taggar:Ingen/inga

Verkdetaljer

Introduction to Algorithms av Thomas H. Cormen

  1. 10
    The Art of Computer Programming, Volumes 1-3 Boxed Set av Donald E. Knuth (billmcn)
    billmcn: The other definitive algorithms textbook, though I like Cormen better because it's shorter and more accessible.
Ingen/inga
Laddar...

Gå med i LibraryThing för att få reda på om du skulle tycka om den här boken.

Det finns inga diskussioner på LibraryThing om den här boken.

» Se även 2 omnämnanden

Visa 1-5 av 6 (nästa | visa alla)
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 rösta 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 rösta billmcn | May 28, 2010 |
Denna recension har flaggats av flera användare som missbruk av våra allmänna villkor och visas därför inte längre (visa).
  knol | Dec 25, 2009 |
Visa 1-5 av 6 (nästa | visa alla)
inga recensioner | lägg till en recension

» Lägg till fler författare (57 möjliga)

Författarens namnRollTyp av författareVerk?Status
Thomas H. Cormenprimär författarealla utgåvorberäknat
Leiserson, Charles E.Författarehuvudförfattarealla utgåvorbekräftat
Rivest, Ronald L.Författarehuvudförfattarealla utgåvorbekräftat
Stein, Cliffordhuvudförfattarealla utgåvorbekräftat
Du måste logga in för att ändra Allmänna fakta.
Mer hjälp finns på hjälpsidan för Allmänna fakta.
Vedertagen titel
Information från den engelska sidan med allmänna fakta. Redigera om du vill anpassa till ditt språk.
Originaltitel
Alternativa titlar
Information från den engelska sidan med allmänna fakta. Redigera om du vill anpassa till ditt språk.
Första utgivningsdatum
Personer/gestalter
Viktiga platser
Viktiga händelser
Relaterade filmer
Priser och utmärkelser
Motto
Dedikation
Inledande ord
Information från den engelska sidan med allmänna fakta. Redigera om du vill anpassa till ditt språk.
What are algorithms?
Citat
Avslutande ord
Särskiljningsnotis
Förlagets redaktörer
På baksidan citeras
Ursprungsspråk
Kanonisk DDC/MDS
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.

Inga biblioteksbeskrivningar kunde hittas.

Bokbeskrivning
Haiku-sammanfattning

Snabblänkar

Populära omslag

Betyg

Medelbetyg: (4.27)
0.5
1 1
1.5
2 6
2.5
3 32
3.5 1
4 105
4.5 9
5 115

Är det här du?

Bli LibraryThing-författare.

 

Om | Kontakt | LibraryThing.com | Sekretess/Villkor | Hjälp/Vanliga frågor | Blogg | Butik | APIs | TinyCat | Efterlämnade bibliotek | Förhandsrecensenter | Allmänna fakta | 152,517,747 böcker! | Topplisten: Alltid synlig