- Hardcover: 3168 pages
- Publisher: Addison-Wesley Professional; 1 edition (March 3, 2011)
- Language: English
- ISBN-10: 0321751043
- ISBN-13: 978-0321751041
- Product Dimensions: 7.3 x 7 x 10.1 inches
- Shipping Weight: 12.9 pounds (View shipping rates and policies)
- Average Customer Review: 78 customer reviews
- Amazon Best Sellers Rank: #50,702 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, Volumes 1-4A Boxed Set 1st Edition
Use the Amazon App to scan ISBNs and compare prices.
Fulfillment by Amazon (FBA) is a service we offer sellers that lets them store their products in Amazon's fulfillment centers, and we directly pack, ship, and provide customer service for these products. Something we hope you'll especially enjoy: FBA items qualify for FREE Shipping and Amazon Prime.
If you're a seller, Fulfillment by Amazon can help you increase your sales. We invite you to learn more about Fulfillment by Amazon .
The Amazon Book Review
Author interviews, book reviews, editors picks, and more. Read it now
Frequently bought together
Customers who bought this item also bought
Customers who viewed this item also viewed
From the Back Cover
This boxed set consists of the following four volumes:
0201896834 / 9780201896831 Art of Computer Programming, Volume 1: Fundamental Algorithms
0201896842 / 9780201896848 Art of Computer Programming, Volume 2: Seminumerical Algorithms
0201896850 / 9780201896855 Art of Computer Programming, Volume 3: Sorting and Searching
0201038048 / 9780201038040 Art of Computer Programming, Volume 4A: Combinatorial Algorithms
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 (26 books, 161 papers). Professor Emeritus of The Art of Computer Programming at Stanford University, he currently devotes full time to the completion of his seminal multivolume series on classical computer science, begun in 1962 when he was a graduate student at California Institute of Technology. Professor Knuth is the recipient of numerous awards and honors, including the ACM Turing Award, the Medal of Science presented by President Carter, the AMS Steele Prize for expository writing, and, in November, 1996, the prestigious Kyoto Prize for advanced technology. He lives on the Stanford campus with his wife, Jill.
Top customer reviews
There was a problem filtering reviews right now. Please try again later.
There is a lot of history which Knuth makes interesting by stating which algorithms were remarkable discoveries and which were logical extensions of other algorithms. The analysis is much more in depth than other authors especially with regards to run time performance.
At the end of each section there are tons of problems to solve, and full answers are in the back. I especially liked how each problem has a rating on its difficulty. For example, a problem with a rating 10 is easy, rating 25 might take an hour... up to rating 50 which is an unsolved problem in computer science.
Volume one starts with the first 150 pages being math related to computer science. Then the assembly language is introduced which many of the algorithms are written in. The choice for assembly was made so as to not commit to one specific language's paradigm.
Volume two gets into the heart of the algorithms. A lot of interesting things about floating point calculations, and prime number discovery. My overall understanding of computer science improved a ton here.
Volume three was my personal favorite. Knuth explains searching and sorting very well. The evolution of the "trie" data structure was impressive. At first he shows a way to make a trie in a way I had never seen before. Then he showed another way, and finally he got to the modern way I had seen. With this knowledge, I understood how the trie was discovered, how it was improved, and then improved again. Every other algorithm book just shows the modern trie without explaining how they got there.
Volume four is heavy on math again with a lot about permutations and combinatorics. This was the most difficult of the books I felt but also rewarding.
Knuth's writing is excellent. Each sentence is clear and communicates in a way that makes computer history interesting.
The box set itself is beautiful and the paper is high quality. I wish I could give more than 5 stars for the review.
Do yourself a favor. Buy these books, read through them, and try to complete the exercises. I promise you will become a significantly better programmer, regardless of your current skill level.