You are here

Home » MAA Publications » MAA Reviews » The Art of Computer Programming, Volume 3: Sorting and Searching

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

Donald E. Knuth
Publisher: 
Addison-Wesley
Publication Date: 
1998
Number of Pages: 
800
Format: 
Hardcover
Edition: 
2
Price: 
64.99
ISBN: 
9780201896855
Category: 
Textbook
BLL Rating: 
BLL***

The Basic Library List Committee considers this book essential for undergraduate mathematics libraries.

There is no review yet. Please check back later.

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
 
Tags: 
Algorithms