The Art of Computer Programming : Sorting and Searching (Vol 3, 2nd Ed)

Customers who bought this book also bought:

The Art of Computer Programming : Seminumerical Algorithms (Vol 2, 3rd Ed); Donald Ervin Knuth(Preface)
The Art of Computer Programming : Fundamental Algorithms (Vol 1, 3rd Ed); Donald Ervin Knuth
Selected Papers on Computer Science (Csli Lecture Notes, No. 59); Donald Ervin Knuth
Concrete Mathematics : A Foundation for Computer Science; Ronald Graham, et al

Reviews
Amazon.com
Donald Knuth's The Art of Computer Programming, Volume 3: Sorting and Searching has long been recognized as the classic guide to finding the most appropriate sort and search methods for given sets of data structures, output requirements, and physical storage systems.

Yet this book is far more than just a collection of algorithm recipes. The reader is led to understand the mathematical basis for the verifiability and performance of each algorithm and how each fits within a taxonomy of varying solutions to similar problems. Each algorithm is clearly presented in text, in language-independent pseudocode, and in MIX assembler (MIX is the hypothetical computer model used throughout the Art of Computer Programming series). Flow charts and output diagrams appear frequently to clarify the discussion. The famous exercises, which are graded in difficulty from easy snap-quiz questions to unsolved research problems, keep you from glossing over the material or kidding yourself about what you know. Throughout, Knuth's writing is lucid and witty, and he keeps the most abstruse discussions rooted in reality with concrete examples.

This is the long-awaited second edition of this landmark work. The original, published over 25 years ago, is a widely recognized classic that has challenged and delighted two generations of computer scientists. Of all of Knuth's theoretical studies, this book may be the most approachable and, for many programmers, the most directly applicable to day-to-day tasks. --Thomas Mace

Book Description
The first revision of 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 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative 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 hashing.

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 (19 books, 160 papers). Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of his seminal seven-volume series on classical computer science, begun in 1962 when he was a graduate student at California Institute of Technology. Professor Knuth is the recipient of numerous awards and honors, including the ACM Turing Award, the Medal of Science presented by President Carter, the AMS Steele Prize for expository writing, and, in November, 1996, the prestigious Kyoto Prize for advanced technology. He lives on the Stanford campus with his wife, Jill.

Back to General
Back to Algorithms
Back to Main Index