Pagina principaleGruppiConversazioniAltroStatistiche
Cerca nel Sito
Questo sito utilizza i cookies per fornire i nostri servizi, per migliorare le prestazioni, per analisi, e (per gli utenti che accedono senza fare login) per la pubblicità. Usando LibraryThing confermi di aver letto e capito le nostre condizioni di servizio e la politica sulla privacy. Il tuo uso del sito e dei servizi è soggetto a tali politiche e condizioni.

Risultati da Google Ricerca Libri

Fai clic su di un'immagine per andare a Google Ricerca Libri.

Sto caricando le informazioni...

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

di Donald E. Knuth

UtentiRecensioniPopolaritàMedia votiConversazioni
1,005220,607 (4.55)Nessuno
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  … (altro)
Aggiunto di recente daanths, prengel90, amialive, Maddz, skaersoe, jsackey, sullen
Sto caricando le informazioni...

Iscriviti per consentire a LibraryThing di scoprire se ti piacerà questo libro.

Attualmente non vi sono conversazioni su questo libro.

Mostra 2 di 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 |
Mostra 2 di 2
nessuna recensione | aggiungi una recensione

Appartiene alle Serie

Devi effettuare l'accesso per contribuire alle Informazioni generali.
Per maggiori spiegazioni, vedi la pagina di aiuto delle informazioni generali.
Titolo canonico
Dati dalle informazioni generali inglesi. Modifica per tradurlo nella tua lingua.
Titolo originale
Titoli alternativi
Data della prima edizione
Personaggi
Luoghi significativi
Eventi significativi
Film correlati
Epigrafe
Dedica
Incipit
Citazioni
Ultime parole
Nota di disambiguazione
Redattore editoriale
Elogi
Lingua originale
DDC/MDS Canonico
LCC canonico
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  

Non sono state trovate descrizioni di biblioteche

Descrizione del libro
Riassunto haiku

Discussioni correnti

Nessuno

Copertine popolari

Link rapidi

Voto

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

Sei tu?

Diventa un autore di LibraryThing.

 

A proposito di | Contatto | LibraryThing.com | Privacy/Condizioni d'uso | Guida/FAQ | Blog | Negozio | APIs | TinyCat | Biblioteche di personaggi celebri | Recensori in anteprima | Informazioni generali | 204,457,554 libri! | Barra superiore: Sempre visibile