£206.59
  • RRP: £207.99
  • You Save: £1.40 (1%)
FREE Delivery in the UK.
In stock.
Dispatched from and sold by Amazon. Gift-wrap available.
The Art of Computer Progr... has been added to your Basket

Dispatch to:
To see addresses, please
Or
Please enter a valid UK postcode.
Or
Have one to sell?
Flip to back Flip to front
Listen Playing... Paused   You're listening to a sample of the Audible audio edition.
Learn more
See all 8 images

The Art of Computer Programming: Volumes 1-4a (Box Set) Hardcover – 3 Mar 2011

4.3 out of 5 stars 18 customer reviews

See all formats and editions Hide other formats and editions
Amazon Price
New from Used from
Hardcover
"Please retry"
£206.59
£143.47 £172.89
£206.59 FREE Delivery in the UK. In stock. Dispatched from and sold by Amazon. Gift-wrap available.
click to open popover

Frequently bought together

  • The Art of Computer Programming: Volumes 1-4a (Box Set)
  • +
  • Concrete Mathematics: Foundation for Computer Science
  • +
  • Introduction to Algorithms
Total price: £325.04
Buy the selected items together

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.

  • Apple
  • Android
  • Windows Phone

To get the free app, enter your mobile phone number.



Product details

  • Hardcover: 3168 pages
  • Publisher: Addison Wesley; 3rd Revised edition edition (3 Mar. 2011)
  • Language: English
  • ISBN-10: 0321751043
  • ISBN-13: 978-0321751041
  • Product Dimensions: 18.5 x 17.8 x 25.9 cm
  • Average Customer Review: 4.3 out of 5 stars  See all reviews (18 customer reviews)
  • Amazon Bestsellers Rank: 137,101 in Books (See Top 100 in Books)
  • If you are a seller for this product, would you like to suggest updates through seller support?

Product description

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.


Customer Reviews

4.3 out of 5 stars
Share your thoughts with other customers

Top Customer Reviews

Format: Hardcover Verified Purchase
You'll need to know your discrete mathematics for these books, but the depth and detail of coverage of the topics is unsurpassed. This is no book of algorithmic recipes, but presents an unparalleled range of algorithms for various common tasks. Your understanding of the problem you want to solve will be stretched. You'll have to consider aspects of the problem you never even thought of. But your understanding of algorithms will be deeper, better and broader than you had thought possible. If you're willing to make an effort to understand problems, this book will reward you. And you'll love it.
Comment 13 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover Verified Purchase
A fantastic compendium of computer science knowledge. Volume 1. gives a nice review of the necessary mathematics for working through this series, although I can highly recommend Knuth's Concrete Mathematics text for the dedicated reader.
Comment 2 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover Verified Purchase
Being a System Architect, understanding computer programming on a complex level is essential to my job. However, I waited 10 years to purchase this boxed set, and finally decided to treat myself as I felt I was at a point in my career where they would prove useful. So I ordered on Amazon and a few days later a large box arrived with TAOCP, each book bound beautifully with a beautiful cover. Clearly books made to be loved and adored.

After reading (or trying to read) the first few pages I slammed the book shut with a bitter look on my face, realising I was out of my depth with the complex algebra used to describe Knuth's algorithms.

So I brought a book to teach myself Algebra to teach myself the basics, and then went back to starting TAOCP, except this time his algorithms made sense and I discovered a new joy in the beauty of this magic set of books. So now several times a week I sit down with TAOCP and curl up on the sofa with a smile as I read through these jewels of wisdoms.
5 Comments 56 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover
Frankly, I am unworthy of reviewing this book, and so are most people on the planet. Donald E. Knuth is the king of algorithms and their analysis, the Aristotle of computer science. When he was a graduate student, he was asked to write a compiler construction text book, and here we are decades later and Prof. Knuth is still working on the book, volume 4B out of 7 total. Mind you volume 7 is the book he was originally commissioned to write, and it will probably never happen. To me, Volume 1 and 3 have been extremely valuable in my career, and the whole set is an inspiration for scientists in that defines the upper limit of what can be achieved in one lifetime, and to me it is existential proof of perfectionism and dedication to work.

If you only ever buy two books to study computer science, buy Knuth's "The Art of Computer Programming" and Abelson & Sussman's Structure and Interpretation of Computer Programs; if you work your way through just the first volume of the former OR the latter, you will probably be a better computer scientist than most. Thank you, Donald Knuth, for giving us these volumes!
Comment 4 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover Verified Purchase
Bought really as a must have reference work. Interesting but rather too detailed and old fashioned and arcane in parts. Very wide coverage of many programming algorithms across the 4 volumes.

Not really good for producing working code. Far better books available for practical use and learning programming techniques.
Useful for historic reference but not great for learning from. You need to know most of it anyway before it makes sense.
Comment 2 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover Verified Purchase
This is a very very long work with a strong, pseudo-academic, emphasis on technical detail. You should definitely assume that you won't have time to read it all, but the information conveyed is useful and clear. It would work quite well as a reference, where you look up some specific topic on your mind, but in that case you might want to research works which are specialised for the topic in mind, as this will not have all the latest information and techniques.

This work (TAoCP) is technically incomplete in that there is more to be added, but as Knuth's life's work it is unlikely that it will be finished in the medium term, so that's definitely no reason not to buy it.

To be frank, it works much better as a token of geekiness than a set of books to read, yet if you do not attempt to read it you will be missing out.
Comment 5 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover Verified Purchase
Love these Reference Books,
I doubt if I will ever read them from page to page, to be honest understanding the 'hard bits' is a challenge!
However I just love to tackle an algorithm, work out on paper what it does and apply it in practice. I just feel that more knowledgeable and these books have a lot of Algorithms to work on in Computing -
It keeps the "mind" young.
Comment One person found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse
Format: Hardcover Verified Purchase
I thought I'd already written a review of these books, but the button came up while I was in a reviewing mood, so you've got it again if you haven't heard it before.
Anyone serious about algorithms, programming or complexity will already have these books.
There are more accessible books on algorithms if you're learning for the first time, but Knuth is a legend and from a maths point of view it's hard to find fault with these books which are a reference everyone should have access to.
High dimension and big data computing present challenges that aren't addressed here, but like Bill said, "If you have read all this and understand it, you should definitely give me a call".
Comment 2 people found this helpful. Was this review helpful to you? Yes No Sending feedback...
Thank you for your feedback.
Sorry, we failed to record your vote. Please try again
Report abuse

Look for similar items by category