,

Art of Computer Programming, The

Sorting and Searching, Volume 3

Gebonden Engels 1998 9780201896855
(MB) CB:0/0 MB:0 BS:2
87,34

Samenvatting

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.

Specificaties

ISBN13:9780201896855
Taal:Engels
Bindwijze:Gebonden
Herdrukdatum:28-11-2025

Lezersrecensies

Wees de eerste die een lezersrecensie schrijft!

Inhoudsopgave

<br> <br> 5. Sorting. <br> <p> </p> <div style="margin-left: 0.2in;"> Combinatorial Properties of Permutations. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Inversions. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Permutations of a Multiset. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Runs. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Tableaux and Involutions. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Internal sorting. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Sorting by Insertion. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Sorting by Exchanging. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Sorting by Selection. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Sorting by Merging. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Sorting by Distribution. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Optimum Sorting. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Minimum-Comparison Sorting. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Minimum-Comparison Merging. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Minimum-Comparison Selection. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Networks for Sorting. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> External Sorting. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Multiway Merging and Replacement Selection. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> The Polyphase Merge. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> The Cascade Merge. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Reading Tape Backwards. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> The Oscillating Sort. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Practical Considerations for Tape Merging. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> External Radix Sorting. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Two-Tape Sorting. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Disks and Drums. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Summary, History, and Bibliography. </div> <p></p> <br> <br> 6. Searching. <br> <p> </p> <div style="margin-left: 0.2in;"> Sequential Searching. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Searching by Comparison of Keys. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Searching an Ordered Table. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Binary Tree Searching. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Balanced Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Multiway Trees. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Digital Searching. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Hashing. </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Retrieval on Secondary Keys. </div> <p></p> <br> <br> Answers to Exercises. <br> <br> <br> Appendix A: Tables of Numerical Quantities. <br> <p> </p> <div style="margin-left: 0.2in;"> Fundamental Constants (decimal). </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Fundamental Constants (octal). </div> <p></p> <p> </p> <div style="margin-left: 0.2in;"> Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. </div> <p></p> <br> <br> Appendix B: Index to Notations. <br> <br> <br> Index and Glossary. 0201896850T04062001 <br>

Managementboek Top 100

Rubrieken

Populaire producten

    Personen

      Trefwoorden

        Art of Computer Programming, The