HemGrupperDiskuteraMerTidsandan
Sök igenom hela webbplatsen
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.

Resultat från Google Book Search

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

Laddar...

The Art of Computer Programming, Volume 3: Sorting and Searching (1973)

av Donald E. Knuth

MedlemmarRecensionerPopularitetGenomsnittligt betygDiskussioner
1,004220,632 (4.55)Ingen/inga
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.   -Byte, September 1995   I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.   -Charles Long   If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing.   -Bill Gates   It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers.   -Jonathan Laventhol   The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org  … (mer)
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.

danska (1)  engelska (1)  Alla språk (2)
Visar 2 av 2
Indeholder "Preface", "Preface to the Second Edition", "Notes on the Exercises", "Chapter 5. Sorting", " 5.1* Combinatorial Properties of Permutations", " 5.1.1* Inversions", " 5.1.2* Permutations of a Multiset", " 5.1.3* Runs", " 5.1.4* Tableaux and Involutions", " 5.2. Internal sorting", " 5.2.1. Sorting by Insertion", " 5.2.2. Sorting by Exchanging", " 5.2.3. Sorting by Selection", " 5.2.4. Sorting by Merging", " 5.2.5. Sorting by Distribution", " 5.3. Optimum Sorting", " 5.3.1. Minimum-Comparison Sorting", " 5.3.2* Minimum-Comparison Merging", " 5.3.3* Minimum-Comparison Selection", " 5.3.4* Networks for Sorting", " 5.4. External Sorting", " 5.4.1. Multiway Merging and Replacement Selection", " 5.4.2. The Polyphase Merge", " 5.4.3. The Cascade Merge", " 5.4.4. Reading Tape Backwards", " 5.4.5. The Oscillating Sort", " 5.4.6. Practical Considerations for Tape Merging", " 5.4.7* External Radix Sorting", " 5.4.8* Two-Tape Sorting", " 5.4.9. Disks and Drums", " 5.5. Summary, History, and Bibliography", "Chapter 6. Searching", " 6.1 Sequential Searching", " 6.2 Searching by Comparison of Keys", " 6.2.1 Searching an Ordered Table", " 6.2.2 Binary Tree Searching", " 6.2.3 Balanced Trees", " 6.2.4 Multiway Trees", " 6.3. Digital Searching", " 6.4. Hashing", " 6.5. Retrieval on Secondary Keys", "Answers to Exercises", "Appendix A: Tables of Numerical Quantities", " 1. Fundamental Constants (decimal)", " 2. Fundamental Constants (octal)", " 3. Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers", "Appendix B: Index to Notations", "Index and Glossary".

Biblen om sortering og søgning. En masse varianter hedder noget med Knuth, fx Bose-Nelson-Knuth Search. ( )
  bnielsen | Nov 8, 2016 |
I used to be able to quote verbatim from various parts of this book. The massive influence Knuth had upon the computing world cannot be overestimated. I long ago accepted that the promised volumes 4, 5, 6, and 7 would never appear, and am pleased and amazed to see that there's a Volume 4A. ( )
  Lyndatrue | Jan 11, 2014 |
Visar 2 av 2
inga recensioner | lägg till en recension
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
Första utgivningsdatum
Personer/gestalter
Viktiga platser
Viktiga händelser
Relaterade filmer
Motto
Dedikation
Inledande ord
Citat
Avslutande ord
Särskiljningsnotis
Förlagets redaktörer
På omslaget citeras
Ursprungsspråk
Kanonisk DDC/MDS
Kanonisk LCC
The bible of all fundamental algorithms and the work that taught many of today's software developers most of what they know about computer programming.   -Byte, September 1995   I can't begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home... and even at a Little League game when my son wasn't in the line-up.   -Charles Long   If you think you're a really good programmer... read [Knuth's] Art of Computer Programming... You should definitely send me a resume if you can read the whole thing.   -Bill Gates   It's always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers.   -Jonathan Laventhol   The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org  

Inga biblioteksbeskrivningar kunde hittas.

Bokbeskrivning
Haiku-sammanfattning

Pågående diskussioner

Ingen/inga

Populära omslag

Snabblänkar

Betyg

Medelbetyg: (4.55)
0.5
1
1.5
2 2
2.5
3 6
3.5
4 14
4.5 5
5 49

Ä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 | 204,454,702 böcker! | Topplisten: Alltid synlig