Download the free Kindle app and start reading Kindle books instantly on your smartphone, tablet, or computer - no Kindle device required.
Read instantly on your browser with Kindle for Web.
Using your mobile phone camera - scan the code below and download the Kindle app.
Follow the author
OK
The Art of Computer Programming, Vols. 1-3 Hardcover – Box set, January 1, 1998
Knuth's classic work has been widely acclaimed as one of the most influential works in the field of computer science. For the first time, these books are available as a boxed, three-volume set. The handsome slipcase makes this set an ideal gift for the recent computer science graduate or professional programmer. Offering a description of classical computer science, this multi-volume work is a useful resource in programming theory and practice for students, researchers, and practitioners alike. For programmers, it offers cookbook solutions to their day-to-day problems.
- LanguageEnglish
- PublisherAddison-Wesley Professional
- Publication dateJanuary 1, 1998
- Dimensions7.5 x 5.25 x 10 inches
- ISBN-100201485419
- ISBN-13978-0201485417
Customers who bought this item also bought
Art of Computer Programming, The: Combinatorial Algorithms, Volume 4A, Part 1Donald KnuthHardcover$11.90 shippingOnly 9 left in stock - order soon.
Editorial Reviews
From the Inside Flap
"If you think you're a really good programmer,...read [Knuth's] Art of Computer Programming....You should definitely send me a resume if you can read the whole thing." -- Bill Gates
This Knuth set is perfect for your own reference bookshelf, and makes an ideal gift for any serious student or practitioner of computer programming.
From the Back Cover
0201485419B04062001
About the Author
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.
Product details
- Publisher : Addison-Wesley Professional; 3rd edition (January 1, 1998)
- Language : English
- ISBN-10 : 0201485419
- ISBN-13 : 978-0201485417
- Item Weight : 9.35 pounds
- Dimensions : 7.5 x 5.25 x 10 inches
- Best Sellers Rank: #2,503,688 in Books (See Top 100 in Books)
- #3,702 in Microsoft Programming (Books)
- #9,276 in Computer Software (Books)
- Customer Reviews:
Important information
To report an issue with this product or seller, click here.
About the author

Donald E. Knuth was born on January 10, 1938 in Milwaukee, Wisconsin. He studied mathematics as an undergraduate at Case Institute of Technology, where he also wrote software at the Computing Center. The Case faculty took the unprecedented step of awarding him a Master's degree together with the B.S. he received in 1960. After graduate studies at California Institute of Technology, he received a Ph.D. in Mathematics in 1963 and then remained on the mathematics faculty. Throughout this period he continued to be involved with software development, serving as consultant to Burroughs Corporation from 1960-1968 and as editor of Programming Languages for ACM publications from 1964-1967.
He joined Stanford University as Professor of Computer Science in 1968, and was appointed to Stanford's first endowed chair in computer science nine years later. As a university professor he introduced a variety of new courses into the curriculum, notably Data Structures and Concrete Mathematics. In 1993 he became Professor Emeritus of The Art of Computer Programming. He has supervised the dissertations of 28 students.
Knuth began in 1962 to prepare textbooks about programming techniques, and this work evolved into a projected seven-volume series entitled The Art of Computer Programming. Volumes 1-3 first appeared in 1968, 1969, and 1973. Having revised these three in 1997, he is now working full time on the remaining volumes. Volume 4A appeared at the beginning of 2011. More than one million copies have already been printed, including translations into ten languages.
He took ten years off from that project to work on digital typography, developing the TeX system for document preparation and the METAFONT system for alphabet design. Noteworthy by-products of those activities were the WEB and CWEB languages for structured documentation, and the accompanying methodology of Literate Programming. TeX is now used to produce most of the world's scientific literature in physics and mathematics.
His research papers have been instrumental in establishing several subareas of computer science and software engineering: LR(k) parsing; attribute grammars; the Knuth-Bendix algorithm for axiomatic reasoning; empirical studies of user programs and profiles; analysis of algorithms. In general, his works have been directed towards the search for a proper balance between theory and practice.
Professor Knuth received the ACM Turing Award in 1974 and became a Fellow of the British Computer Society in 1980, an Honorary Member of the IEEE in 1982. He is a member of the American Academy of Arts and Sciences, the National Academy of Sciences, and the National Academy of Engineering; he is also a foreign associate of l'Academie des Sciences (Paris), Det Norske Videnskaps-Akademi (Oslo), Bayerische Akademie der Wissenschaften (Munich), the Royal Society (London), and Rossiiskaya Akademia Nauk (Moscow). He holds five patents and has published approximately 160 papers in addition to his 28 books. He received the Medal of Science from President Carter in 1979, the American Mathematical Society's Steele Prize for expository writing in 1986, the New York Academy of Sciences Award in 1987, the J.D. Warnier Prize for software methodology in 1989, the Adelskøld Medal from the Swedish Academy of Sciences in 1994, the Harvey Prize from the Technion in 1995, and the Kyoto Prize for advanced technology in 1996. He was a charter recipient of the IEEE Computer Pioneer Award in 1982, after having received the IEEE Computer Society's W. Wallace McDowell Award in 1980; he received the IEEE's John von Neumann Medal in 1995. He holds honorary doctorates from Oxford University, the University of Paris, St. Petersburg University, and more than a dozen colleges and universities in America.
Professor Knuth lives on the Stanford campus with his wife, Jill. They have two children, John and Jennifer. Music is his main avocation.
Customer reviews
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on Amazon-
Top reviews
Top reviews from the United States
There was a problem filtering reviews right now. Please try again later.
Some may think that this masterpiece is rather theoretical and not very applicable in daily programming tasks but did you also know that this book is mentioned in Mitnick's The Art of Intrusion: The Real Stories Behind the Exploits of Hackers, Intruders and Deceivers where a group of hackers try to analyze some slot machines and one of them visits the library to learn more about the random number generation algorithms and picks up TAOCP?
I believe every programmer will find at least a few pages of pure hacker's delight in TAOCP and thus this book belongs to the shelf of every programmer.
Having this set on the shelf is somewhat like having a set of Shakespeare - its the best but not for everyone. One kind of expects to find Volume 1 of this set in the nightstand drawer at Silicon Valley hotels.
This book , written several years ago, is today the best about those facts. I have studied recently the random numbers and I have read the algebric theory of this book . It's interesting as a solutions of algebric equation must verify statistic conditions for effective randomness.
When I first saw this set in a bookstore (years ago), I thought it would be a great addition to my library. However, when I thumbed through it, I didn't seem to enjoy it as much as I'd hoped. It seemed to be a bit too theoretical, and not enough practical examples for my taste.
Recently, I decided to give it another chance on Amazon, thinking that I would better understand the theory after having more experience. Unfortunately, my first reaction stood-- as much as I tried to read it, I just couldn't find a section that I could enjoy or relate to.
In particular, the MIX code is a bit hard to read / follow. Personally, I would prefer a less precise but higher level pseudo-code. (Having to mentally translate the assembly code detracts from the examples.) In addition, I have a harder time relating to some of the examples, such as optimizing the merging of data from multiple tape drives.
There is no question that Knuth is a legend in Computer Science, and this is a very well written, highly regarded work in that field. I'm sure many people enjoy these books. However, this set just isn't something I personally was able to enjoy as much as I'd hoped to.
Top reviews from other countries
Toute bibliothèque Informatique omettant ces livres est tout simplement incomplète, il manque les fondations et "sans fondations, une maison ne tient pas".
Donald E. Knuth n'a plus besoin d'être présenté, il est mondialement connu dans le milieu et est à mon sens l'un des pères fondateurs de l'informatique avec Leslie Lamport notamment. Et il reste une référence dans l'écriture de ses articles et de ses livres, très clair quand on sait de quoi il parle, très bien organisé et de l'humour ce qui ne gache rien ...
Très clairement, ces volumes s'adressent uniquement à un public d'initié et ne font en aucun cas partis des volumes d'introduction à l'algorithmique ou autres. Voici une petite anecdote concernant ces livres. Durant mon stage de maitrise, je travaillais sur les allocateurs de mémoires, voulant faire correctement ma bibliographie, j'ai cité Donald E. Knuth est lu la partie concernant les allocateurs mémoires. Bien mal m'en a pris !!! Plus je lisait et moins je comprenais les algorithmes que je "maitrisais" pourtant (expliqués dans mon mémoire et implantés).
Donald E. Knuth a une vision globale de l'informatique et des sujets qu'il traite, et il est très difficile voire impossible de se mettre à son niveau quand on a pas une solide base et que l'on ne baigne pas quotidiennement dans le domaine (recherche).
En conclusion pour des connaisseurs. Pour les autres, se tourner vers des livres comme Introduction à l'algorithmique de T. Cormen, R. L. Rivest, C. Stein, C. E. Leiserson, ...
Sehr positiv ist das ausbleiben von derartigen Kommentaren als da sind: Die Sprache X ist die Beste oder die Sprache Y würde ich immer vorziehen. Dieser Weg wird durch einen virtuellen Rechner gekonnt umgangen und so der Weg frei, für ein allgemeines besseres Programmieren mit Sicht auf die wichtigen Dinge des Programmierers ermöglicht.
Für Leute mit grundsätzlichen Englischkenntnissen ist der lockere Schreibstil sehr gut zu lesen.
Fazit: Muß man haben !!!
- Les algorithmes proposés sont extrêmement bons et demeurent une Référence.
- Ces livres sont parmi les moins erronés qui existent. L'auteur récompense ceux qui trouvent des erreurs, et il n'y a plus trop d'erreurs à trouver ! C'est sa plus grande qualité. Contrairement au Cormen (Introduction à l'algorithmique / Introduction to algorithms) qui est truffé d'erreurs.
- Il est esthétique, c'est toujours joli d'avoir ces livres dans la bibliothèque.
Les points négatifs :
- Ce n'est pas très très pédagogique, il faut vraiment être motivé pour l'appréhender. (Le Cormen (Introduction à l'algorithmique / Introduction to algorithms) est beaucoup plus pédagogique en comparaison mais ce n'est radicalement pas le même but.)
- Knuth propose des implantations de ses algorithmes, mais en code assembleur. À part pour les fans, c'est assez rebutant. Il y a un petit côté "élitiste".
Attention, ces livres traitent d'algorithmique de manière très sérieuse. Pour ceux qui codent sans se soucier des complexités de leurs algorithmes, sans se soucier des performances, ces livres peuvent aider à se mettre dans le droit chemin, ou bien au contraire ne servir à rien du tout à part à prendre la poussière.
Je recommande ce livre seulement à ceux qui ont aimé leur cours de maths avancés à l'université et qui sont capable de supporter des gros tômes de théorie intensive, hautement compliquée.

