The Art of Computer Programming, Volume 2: Seminumerical Algorithms (2nd Edition)

Knuth's multivolume work, widely recognized as the definitive description of classical computer science, is now available in an attractive, boxed set. The three volumes included in this set have each been revised recently to reflect developments in the field. As earlier editions clearly demonstrated, they comprise an invaluable resource in programming theory and practice for students, researchers, and practitioners alike. Countless readers have spoken about the profound personal influence of Knuth's work. Scientists have marveled at the beauty and elegance of his analysis, while ordinary programmers have successfully applied his "cookbook" solutions to their day-to-day problems. All have admired Knuth for the breadth, clarity, accuracy, and good humor found in his books.See descriptions of each individual volume for more information. The first revision of this third volume is the most comprehensive survey of 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 a new discussion of the theory of permutations and of universal hashing. V. 1. Fundamental Algorithms -- V.2. Seminumerical Algorithms -- V. 3. Sorting And Searching. Donald E. Knuth. Includes Indexes. Bibliography: V. 1, P. 456-463.