- Hardcover: 896 pages
- Publisher: Addison-Wesley Professional; 3rd edition (October 15, 1998)
- Language: English
- ISBN-10: 0201485419
- ISBN-13: 978-0201485417
- Product Dimensions: 7 x 5 x 10 inches
- Shipping Weight: 9.3 pounds
- Average Customer Review: 57 customer reviews
- Amazon Best Sellers Rank: #788,993 in Books (See Top 100 in Books)
Enter your mobile number or email address below and we'll send you a link to download the free Kindle App. Then you can start reading Kindle books on your smartphone, tablet, or computer - no Kindle device required.
To get the free app, enter your mobile phone number.
The Art of Computer Programming, Vols. 1-3 3rd Edition
Use the Amazon App to scan ISBNs and compare prices.
Customers who viewed this item also viewed
What other items do customers buy after viewing this item?
From the Inside Flap
"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, Sept 1995
"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
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.
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.
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.
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.
Top customer reviews
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.
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.
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.