Download address: Network disk download
Content Profile Edit Book author D. E. Knuth, a highly renowned scholar in the field of computer science, enjoys a high degree of authority and reputation in this area, and his work is a textbook and reference material for countless computer professionals, and a classic often read by many professional research workers. This book has been translated into dozens of languages all over the world published, the original English book in foreign countries has been the 11th time printing. At the end of 1999, American scientist was listed as one of the top 12 academic monographs of the 20th century (with Dirac's quantum mechanics, Einstein's theory of relativity, Mandebrott's fractal theory, the chemical bond of Linus, the mathematical principles of Russell and Whitehead, Fengno and Morgenstern game theory, Wiener's cybernetics, Woodward and Hoffman's orbital symmetry, Feynman's quantum electrodynamics and other classics in the scientific history are juxtaposed. This book combines a large number of mathematical knowledge, analysis of different application areas of various algorithms, study the complexity of the algorithm, that is, the algorithm time, space efficiency, explore various applicable algorithms, and its theoretical and practical value has been recognized by computer workers all over the world. Many of the terms introduced in the book, and many of the conclusions obtained, have become standard terminology and widely cited results in the field of computing. In addition, the author of the relevant fields of scientific history also has in-depth research, so this book introduces a lot of research results, but also to its historical origins and development process made a good introduction, this feature in the global scientific works is rare. The author, Gartner, has struggled to measure this book for decades, he sought to keep up with the latest developments in the field, and sought to minimize the technical, historical, and publishing errors or inaccuracies of the original book (he invented the computer typesetting system in order to be able to revise his writings at any time with satisfaction). The Metafont of Tex and Zigzag design systems, which have benefited the world's science and technology literature writers, are now very difficult to find in the latest Inji, and the authors promise to reward any one of the wrong first-time seekers with a 2.56 dollar award. The new evidence of relevant facts, the new progress of related research, and the new solutions of the exercises are still being enriched in time to errata or new Inji. [1] catalogue edited by the author of the plan, a total of 7 volumes of books, the total list is as follows: Volume 1th basic Algorithm (vol. 1:fundamental algorithms) Chapter 1th Basic Concepts (Chapter 1:basic Concepts) Chapter 2nd information structure (Chapter 2:information structures) 2nd volume Half Value Algorithm (vol. 2:seminumerial algorithms) Chapter 3rd random number (Chapter 3:random Numbers) Chapter 4th arithmetic (Ch Apter 4:arithmetic) Volume 3rd Sorting and Finding (vol. 3:sorting and Searching) 5th chapter (Chapter 5:sorting) 6th Chapter find (Chapter 6:searching) 4th Volume Combination Algorithm (vol. 4 : Combinatorial Algorithms) Chapter 7th combinatorial Search (Chapter 7:combinatorial searching) 8th Chapter recursive (Chapter 8:recursion) 5th Volume Syntax Algorithm (vol. 5:synt Actic algorithms) 9th lexical scan (Chapter 9:lexical scanning) Chapter 10th Grammar Analysis (Chapter 10:parsing sechniques) Two other volumes on specialized topics are still in preparation: volume 6th language theory (The theory of Context-free Languages) (11th) and volume 7th compilers (Compiler techniques) (chap. 12th). Author Profile Editor Donald E. Knuth is an honorary retired professor of computer science at Stanford University, a pioneer in algorithmic and procedural design techniques. 1974 won the American Computer Association Turing Award, 1979 former U.S. President Jimmy Carter awarded the Science Gold and November 1996 by the invention of advanced technology won the highly respected Kyoto Award. He was acclaimed by these achievements and by a great number of creative and far-reaching writings (19 books and 160 papers). For Professor Knuth, the standard for measuring whether a computer program is complete is not just whether it can run, he thinks a computer program should be elegant or even beautiful. Computer programming should be an art, an algorithm should be like a piece of music, and a good program should be as a literary work. If you think you're a really good programmer ... Read Knuth's "computer Programming Art", if you can read the whole set of books, please send me a copy of your resume. ―― Bill Gates This is a classic set of all the basic algorithms. Most of the computer programming knowledge that software developers have today comes from this. ――byte
Download address: Network disk download