The Art of Computer Programming - Vol 3: Sorting and Searching

by Donald E. Knuth

Hardcover, 1973

Status

Available

Call number

005.1

Library's review

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.
Show More
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.
Show Less

Publication

Addison Wesley Series (1973), Hardcover

Description

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  … (more)

User reviews

LibraryThing member Lyndatrue
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.

Language

Original language

English

Original publication date

1973

Physical description

723 p.; 23.6 cm

ISBN

020103803X / 9780201038033

Local notes

Omslag: Indbundet
Indskannet omslag - N650U - 150 dpi

Pages

723

Library's rating

Rating

½ (76 ratings; 4.5)

DDC/MDS

005.1
Page: 0.8911 seconds