Art of Computer Programming, Volume 3 : Sorting and Searching (Hardcover)

by Donald E. Knuth

Membership Type Price
Retail Price: $82.49
Online Price: $82.49
Club Price: $74.24
(Save 10%)
Join Now!

Usually ships in 2-4 weeks.

Overview



0201896850B04062001

ALSO AVAILABLE

Used Book Partners offer 17 copies

OTHER FORMATS

Hardcover for Club Price: $197.99

Related Categories:
Books > Computers & Internet > Programming Languages - General
Books > Computers & Internet > Programming - General

 

22 Ratings

  • ISBN-13: 9780201896855
  • ISBN-10: 0201896850
  • Publisher: Addison-Wesley Professional
  • Date: May 1998
  • Page Count: 800

Customer Reviews

Table of Contents

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

 

22 Ratings

  • ISBN: 9780201896855
  • Publisher: Addison-Wesley Professional
  • Date: May 1998
  • Page Count: 800
  • Availability: Usually ships in 2-4 weeks.