هنر برنامه‌نویسی کامپیوتر: الگوریتم‌های نیمه عددی، جلد ۲

This multivolume work on the analysis of algorithms has long been recognized as the definitive description of classical computer science. The three complete volumes published to date already comprise a unique and invaluable resource in programming theory and practice. Countless readers have spoken about the profound personal influence of Knuth's writings. Scientists have marveled at the beauty and elegance of his analysis, while practicing 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. To begin the fourth and later volumes of the set, and to update parts of the existing three, Knuth has created a series of small books called fascicles, which will be published at regular intervals. Each fascicle will encompass a section or more of wholly new or revised material. Ultimately, the content of these fascicles will be rolled up into the comprehensive, final versions of each volume, and the enormous undertaking that began in 1962 will be complete. Volume 4, Fascicle 2 - This fascicle inaugurates the eagerly awaited publication of Knuth's "The Art of Co" 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. Third Edition now available!Volume 2 provides a comprehensive interface between computer programming and numerical analysis. It includes a substantial amount of complexity theory, number theory, and statistics. 0201038226B04062001 V. 1. Fundamental Algorithms -- V.2. Seminumerical Algorithms -- V. 3. Sorting And Searching. Donald E. Knuth. Includes Indexes. Bibliography: V. 1, P. 456-463.