Computer Programming Art, Volume 3: Sorting and Searching (3rd Edition)

Author: Donald E. Knuth
Publisher:
Publication Date: 2002-09-01
Features: If you are a truly excellent programmer, read Knuth's The Art of Computer Programming. If you understand the entire book, please send me your resume. — Bill Gates
This multi-volume work is widely recognized as the authoritative description of classic computer science. For decades, the first three volumes of this series have been invaluable resources for students, researchers, and programming professionals in learning programming theory and practicing programming. It is a classic work that compiles all fundamental algorithms, and the vast majority of computer programming knowledge that today's software developers possess originates from this series. — Byte
To reflect the new developments in the field of computer science, Knuth has revised all three volumes of the book over the past twenty years. His revisions primarily focus on new knowledge that has been widely recognized since the previous edition, solved problems, and evolving issues. To maintain the book's authority, historical information about the pioneering work in the field of computer science has been updated where necessary; to uphold the author's reputation for meticulous pursuit of perfection, the new edition has corrected a few technical errors discovered by readers; and to increase the book's challenge, the author has added hundreds of exercises.
The series consists of three volumes.
Volume 1: Fundamental Algorithms
Volume 1 first introduces the basic concepts and techniques of programming, then provides a detailed explanation of information structures, including the internal representation of information, the structural relationships between data elements, and effective information processing methods. Additionally, the book describes the primary applications of programming in simulation, numerical methods, symbolic computation, software and system design, among others. The new edition has added dozens of simple but important algorithms and techniques, and has made substantial revisions to the mathematical prerequisites based on current research trends.
Volume 2: Semi-Numeric Algorithms
Volume 2 provides a comprehensive introduction to the field of semi-numeric algorithms, divided into two chapters: "Random Numbers" and "Arithmetic." This volume summarizes major algorithm paradigms and their fundamental theories, extensively analyzing the interconnections between computer programming and numerical analysis. The most notable feature of the third edition is Knuth's reprocessing of random number generators and his in-depth discussion of formal power series computation.
Volume 3: Sorting and Searching
This is the first revision of Volume 3, which not only provides a comprehensive introduction to classic computer sorting and searching techniques but also further expands the data structure processing techniques introduced in Volume 1, taking into account both large and small databases and internal and external memory. It selects and analyzes the efficiency of some well-tested computer methods. The outstanding feature of Volume 3 is the revision of the "Optimal Sorting" section and the new discussion of permutation theory and universal hashing methods.
This series is suitable for all computer professionals who wish to delve deeper into programming and can also serve as a textbook for computer science majors.