
Reserve it at BN.com & pick it up in 60 minutes at your local store.
Enter a zip code
(Hardcover - REV)
This multivolume work is widely recognized as the definitive description of classical computer science. The first three volumes have for decades been an invaluable resource in programming theory and practice for students, researchers, and practitioners alike.
The bible of all fundamental algorithms and the work that taught many of today’s software developers most of what they know about computer programming.
–Byte, September 1995
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.
I can’t begin to tell you how many pleasurable hours of study and recreation they have afforded me! I have pored over them in cars, restaurants, at work, at home… and even at a Little League game when my son wasn’t in the line-up.
–Charles Long
Primarily written as a reference, some people have nevertheless found it possible and interesting to read each volume from beginning to end. A programmer in China even compared the experience to reading a poem.
If you think you’re a really good programmer… read [Knuth’s] Art of Computer Programming… You should definitely send me a résumé if you can read the whole thing.
–Bill Gates
Whatever your background, if you need to do any serious computer programming, you will find your own good reason to make each volume in this series a readily accessible part of your scholarly or professional library.
It’s always a pleasure when a problem is hard enough that you have to get the Knuths off the shelf. I find that merely opening one has a very useful terrorizing effect on computers.
–Jonathan Laventhol
For the first time in more than 20 years, Knuth has revised all three books to reflect more recent developments in the field. His revisions focus specifically on those areas where knowledge has converged since publication of the last editions, on problems that have been solved, on problems that have changed. In keeping with the authoritative character of these books, all historical information about previous work in the field has been updated where necessary. Consistent with the author’s reputation for painstaking perfection, the rare technical errors in his work, discovered by perceptive and demanding readers, have all been corrected. Hundreds of new exercises have been added to raise new challenges.
Knuth is eminent for his pioneering work on algorithms and programming techniques, for his invention of T
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. Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of these fascicles and the seven volumes to which they belong.
Reader Rating:
See Detailed Ratings
October 13, 2008: Unfortunately, I find I struggle with the mathematics more than I would like. Nevertheless, the effort you spend on these is rewarded. Be warned that this is definitely computer science material, and not a quickstart guide to your favorite programming language.
Reader Rating:
See Detailed Ratings
October 28, 2002: These three books are amazing. A deep, definitive coverage of the theoretical basis of computer science. In fact, to the extent that computer science is a science, you should refer to these books, if you are ever in doubt. As a measure of how well regarded these are, Knuth mentions in his home page that American Scientist magazine ranked this amongst the top 12 scientific monographs of the twentieth century, alongside books by Einstein, Dirac, Pauling and Feynman. Much of computer programming and usage today builds upon the algorithms described in the books. What does it mean to have a "good" random number generator? What are quantitative tests for randomness? How can you efficiently sort a list? How do you find the greatest common factor of two (large) positive integers? It is true that the typical computer programmer does not know most of the material in the books. This is because she usually can access subroutines that come with the language or are in standard libraries that implement the core algorithms. For example, in Java, there is a routine called Collections.sort(), which you call with the name of a list in the brackets, and the routine will sort it. But within the field of computer programming, sometimes you may be called upon to implement those core algorithms. So what do you do? Turn here for help. The books are also graced with a vital attribute. Each section of a chapter has a set of questions. Typically these are tough; they can keep you busy indeed. Plus, Knuth supplies the answers. The combination is a great learning experience. So often have I wondered at textbooks that don't supply questions. Students need hands on experience.