The Art Of Computer Programming: Sorting And Searching (Volume 3)

0.0

In keeping with the authoritative character of the other two volumes in the “Art of Computer Programming” series, in this book too, all historical information about previous work in the field has been updated where necessary. Hundreds of new exercises have been added to raise new challenges. This third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume I to consider both large and small databases and internal and external memories. This book contains a selection of carefully checked computer methods, with aquantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal handling. About The Author 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. Table Of Contents Sorting Searching Answers to Exercises Appendices Table of Numerical Questions Index to Notations Index and Glossary