Fundamental algorithms : the art of computer programming volume 1 / Donald E. Knuth

By:

Knuth, Donald E, 1938-

Material type: Text

TextSeries: Addison-Wesley series in computer science and information processingPublication details: Reading [Mass.] London Addison-Wesley; 1973Edition: 2nd edISBN:

020103803X

Subject(s):

DDC classification:

005.1 KNU

Holdings
Item type	Current library	Call number	Copy number	Status	Date due	Barcode
Standard Loan	Moylish Library Main Collection	005.1 KNU (Browse shelf(Opens below))	4	Available		39002000003864

Enhanced descriptions from Syndetics:

The first revision of this third volume is a 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.

Includes index

Table of contents provided by Syndetics

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