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

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

Einband:
Fester Einband
EAN:
9780201896855
Untertitel:
Sorting and Searching, Volume 3
Genre:
Programmiersprachen
Autor:
Donald Knuth, Donald E. Knuth
Herausgeber:
Pearson Education Orphans
Auflage:
2. Auflage
Anzahl Seiten:
800
Erscheinungsdatum:
24.04.1998
ISBN:
978-0-201-89685-5

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.



Autorentext
Donald E. Knuth is known throughout the world for his pioneering work on algorithms and programming techniques, for his invention of the Tex and Metafont systems for computer typesetting, and for his prolific and influential writing. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.



Zusammenfassung
Presents a comprehensive survey of classical computer techniques for sorting and searching. This book considers both large and small databases and internal and external memories. It contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency, and also a section on optimum sorting.

Inhalt


5. Sorting.
Combinatorial Properties of Permutations. Inversions. Permutations of a Multiset. Runs. Tableaux and Involutions. Internal sorting. Sorting by Insertion. Sorting by Exchanging. Sorting by Selection. Sorting by Merging. Sorting by Distribution. Optimum Sorting. Minimum-Comparison Sorting. Minimum-Comparison Merging. Minimum-Comparison Selection. Networks for Sorting. External Sorting. Multiway Merging and Replacement Selection. The Polyphase Merge. The Cascade Merge. Reading Tape Backwards. The Oscillating Sort. Practical Considerations for Tape Merging. External Radix Sorting. Two-Tape Sorting. Disks and Drums. Summary, History, and Bibliography.

6. Searching.
Sequential Searching. Searching by Comparison of Keys. Searching an Ordered Table. Binary Tree Searching. Balanced Trees. Multiway Trees. Digital Searching. Hashing. Retrieval on Secondary Keys.

Answers to Exercises.


Appendix A: Tables of Numerical Quantities.
Fundamental Constants (decimal). Fundamental Constants (octal). Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers.

Appendix B: Index to Notations.


Index and Glossary. 0201896850T04062001


billigbuch.ch sucht jetzt für Sie die besten Angebote ...

Loading...

Die aktuellen Verkaufspreise von 6 Onlineshops werden in Realtime abgefragt.

Sie können das gewünschte Produkt anschliessend direkt beim Anbieter Ihrer Wahl bestellen.


Feedback