Computer Programming art 3rd-volume sorting and searching (English version. 2nd)

Computer Programming art 3rd-volume sorting and searching (English version. 2nd)

Basic information:

Original Title: Art of computer programming, Volume 3: sorting and searching (2nd edition)
Original Press: Addison-Wesley professional
Author: (US) Donald E. knuth [Translator's introduction]
Series name: Classic original Library
Press: Machinery Industry Press
ISBN: 9787111227175

Author profile:

Donald E. knuth (Donald E. knut, Chinese name Gao Dana) pioneer in algorithm and programming technology, inventor of the Computer typographical system Tex and metafont. He has contributed to these achievements and a large number of creative and far-reaching works (19 books, 160 papers. As an honorary retired professor of computer programming art at Stanford University. At present, he has invested all his energy to complete the work of the 7-volume collection of the history and poetry of computer science. This great project started in 1962 when he was a graduate student at Caltech. Professor knuth received many awards and honors, including the ACM Turing Award from the American Computer Society, the scientific Gold Award from former US President Carter, and the Steyr Award from the American Mathematical Society, and the prestigious Kyoto Award received in November 1996 for the invention of advanced technologies.

Directory:

Chapter 5-sorting
5.1 combinatorial properties of permutations
5.1.1 Inversions
5.1.2 permutations of A Multiset
5.1.3 runs
5.1.4 tableaux and involutions
5.2 Internal sorting
5.2.1 sorting insertion
5.2.2 sorting by exchanging
5.2.3 sorting by selection
5.2.4 sorting by merging
5.2.5 sorting by distribution
5.3 optimum sorting
5.3.1 minimum-comparison sorting
5.3.2 minimum-comparison Merging
5.3.3 minimum-comparison Selection
5.3.4 networks for sorting
5.4 external sorting
5.4.1 multiway merging and replacement Selection
5.4.2 The polyphase merge

. 5.4.3 the casecade merge
5.4.4 reading tape backwards
5.4.5 the oscillating sort
5.4.6 practical considerations for tape Merging
5.4.7 external Radix sorting
5.4.8 two-tape sorting
5.4.9 disks and drums
5.5 summary, history, and bibliography
Chapter 6-searching
6.1 sequential searching
6.2 searching by comparison of keys
6.2.1 searching an ordered table
6.2.2 Binary Tree searching
6.2.3 balanced trees
6.2.4 multiway trees
6.3 digital searching
6.4 hashing
6.5 retrieval on secondary keys
Answers to exercises
Appendix A-tablesof numerical quantities
1. fundamental constants (decimal)
2. fundamental constants (octal)
3. harmonic numbers, Bernoulli Numbers, and Fibonacci numbers
Appendix B-Lndex to notations
Index and glossary

Book Purchase address: http://www.china-pub.com/37578&ref=ps#ml