Buy used: $276.80
FREE delivery Saturday, May 4. Order within 11 hrs 37 mins
Used: Very Good | Details
Sold by Books In Demand
Condition: Used: Very Good
Comment: Complete set with box.
Access codes and supplements are not guaranteed with used items.
Loading your book clubs
There was a problem loading your book clubs. Please try again.
Not in a club? Learn more
Amazon book clubs early access

Join or create book clubs

Choose books together

Track your books
Bring your club to Amazon Book Clubs, start a new book club and invite your friends to join, or find a club that’s right for you for free.
Kindle app logo image

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.

QR code to download the Kindle App

Follow the author

Something went wrong. Please try your request again later.

The Art of Computer Programming, Volumes 1-4A Boxed Set 1st Edition

4.9 4.9 out of 5 stars 571 ratings

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


In describing the new fourth volume, one reviewer listed the qualities that distinguish all of Knuth’s work.


[In sum:] detailed coverage of the basics, illustrated with well-chosen examples; occasional forays into more esoteric topics and problems at the frontiers of research; impeccable writing peppered with occasional bits of humor; extensive collections of exercises, all with solutions or helpful hints; a careful attention to history; implementations of many of the algorithms in his classic step-by-step form.

— Frank Ruskey


These four books comprise what easily could be the most important set of information on any serious programmer’s bookshelf.


Amazon First Reads | Editors' picks at exclusive prices

From the Publisher

TAOCP box set 1-4B

Updated Box Set Now Available!

This new box set now includes Volume 4B - Combinatorial Algorithms, Part 2

"I've had loads of fun writing other parts of these volumes, but without doubt Section 7.2.2.1 [of Combinatorial Algorithms, Part 2] has been the funnest. And I know that my delight in good puzzles is shared by a significant number of leading computer scientists and mathematicians, who have told me that they chose their careers after having been inspired by such intellectual challenges."

— Donald Knuth

The Art of Computer Programming Volumes 1-4B

ISBN-10: 0137935102

Editorial Reviews

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. 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; 1st edition (March 3, 2011)
  • Language ‏ : ‎ English
  • Hardcover ‏ : ‎ 3168 pages
  • ISBN-10 ‏ : ‎ 0321751043
  • ISBN-13 ‏ : ‎ 978-0321751041
  • Item Weight ‏ : ‎ 27.2 pounds
  • Dimensions ‏ : ‎ 9 x 8.9 x 9 inches
  • Customer Reviews:
    4.9 4.9 out of 5 stars 571 ratings

About the author

Follow authors to get new release updates, plus improved recommendations.
Donald E. Knuth
Brief content visible, double tap to read full content.
Full content visible, double tap to read brief content.

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

4.9 out of 5 stars
4.9 out of 5
571 global ratings
Worth every penny
5 Stars
Worth every penny
I have read some chapters online before making this purchase. This collection is invaluable and is absolutely worth your money.
Thank you for your feedback
Sorry, there was an error
Sorry we couldn't load the review

Top reviews from the United States

Reviewed in the United States on April 4, 2013
Since receipt of volume 4A two days ago, I have been dipping into this and that topic via the indexes ...

What an excellent authoritive masterful survey - up to 2011 - of combinatorial exhaustive search techniques ...

And, some focus on application to business usable sorting and searching techniques ...

Excellent and comprehensive chapter on bitwise tips and techniques, and all sorts of other obscure techniques such as resolution and radix sorting that may not be obvious to information systems graduates who don't have to study algorithms in depth.

(Must confess I've seen earlier editions of volumes 1 to 3 before!)

Donald Knuth is not averse to explaining some things in terms of history or heuristic ... the only heuristic explanation I'm familiar with he doesn't raise are the ones based on the laws of thermodynamics. There is this argument that to understand sorting algorithms one must consider the entrophy gains and losses as the system becomes more ordered and the consequent radiated heat somewhere else in the universe. The related argument from nuclear cell division DNA replication - in science fiction called sometimes the life force - is that when one duplicates information there is a consequent 'life force' heat side effect from the physical law of the conservation of information in quantum mechanics equations. The heuristic explanation then is that if we can minimise the heat from the sorting, we'll have found the best sorting algorithm. Now quicksort wastes more fractions of distinguishment than multi-pass-N-way merge sorting in theory ... so there is more tiny fractions of wasted bits caused by the comparisions. If the exchanges are free and there is unlimited memory then less wasted bit fractions of distinguishment would mean less heat therefore quicksort should on average be slower ... but practical tests proves quicksort faster!

That's the problem with heuristics!

However, reading through some fo Knuth's essays on exhaustive searching may suggest a solution ... that if we have 64K 32 bit integers, to minimise comparisions we precompute all partitions of the 64K into several thousand sequences of varying length less than length 17, use table driven state machines to optimally sort these sequences in place, and check each resultant multi-pass-N-way merge sort for total wasted bits of distinguishment to find the best breakdown to compare quicksort with. This impossible to conduct experiment would then show the validity or invalidity of applying thermodynamics to the problem ...

Unfortunately for me I bought this volume hoping to get a survey of the latest news on the P-NP completeness problem. I will have to await volume 4B for that!
17 people found this helpful
Report
Reviewed in the United States on March 11, 2024
The work of a lifetime of a real genius, a work still in progress. A must have reference for anyone who involves in serious computer programming. This edition comes in a nice boxed set that just calls for volume 4B as a proper companion.
Reviewed in the United States on February 9, 2016
I read this book cover to cover which took me over 3 months, and I was extremely impressed with this collection. Knuth turns computer programming into an art form as the title suggests.

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.
275 people found this helpful
Report
Reviewed in the United States on September 1, 2011
Since reviews of the book content can be found elsewhere, I thought I'd review the actual collection that I bought - these four books and the box that they came in.

They are beautiful, the off-white coloured dust jackets make a pleasing change to the other pure white books that I have on my desk, and the box sets the set apart from everything else.

Also, since purchasing this set, the following things have happened.

1) My IQ increased by 1 point as soon as I placed the box on my bookshelf
2) The Women in my IT department increased their rating of me by 1.5. Apparently I'm now an 8 (9 if I take my glasses off) my colleagues report that this is a 0.5 increase in rating over a non-boxed collection of these books.
3) I have found that taking one book out, opening to a random page and inhaling deeply, when combined with a double-shot coffee, will ensure good spirits and coding karma for at least the next 4 hours.

My only complaint about this set is the fact that they are fairly snugly fit in the box. this requires actually tipping the box forward to select a book, you cannot fit your finger over the top of any one book to pull it out. The exaggerated action of doing this, however invokes jealous looks and dreamy eyes from my male and female/gay colleagues respectively so is worth it.

in short: buy this set!
601 people found this helpful
Report

Top reviews from other countries

Translate all reviews to English
Miguel Jimenez
5.0 out of 5 stars Excellent product
Reviewed in Mexico on February 12, 2022
Great package with 4 excellent books, it's an amazing experience. I will dedicate more time to read...

Paquete genial con 4 libros, una experiencia increíble. Dedicaré más tiempo para leer...
Customer image
Miguel Jimenez
5.0 out of 5 stars Excellent product
Reviewed in Mexico on February 12, 2022
Great package with 4 excellent books, it's an amazing experience. I will dedicate more time to read...

Paquete genial con 4 libros, una experiencia increíble. Dedicaré más tiempo para leer...
Images in this review
Customer image
Inselstein
5.0 out of 5 stars Must have!
Reviewed in Germany on April 10, 2024
Etwas schräge, etwas verkomplizierte Perspektive mit einer hohen therapeutischen Wirkung... manchmal?
RicardoVilarinho
5.0 out of 5 stars Muito bom
Reviewed in Spain on September 23, 2023
Excelente
Federico Milano
5.0 out of 5 stars Exceptional
Reviewed in the United Kingdom on December 4, 2021
These books are outstanding. The contents and text has been polished over the last half a century. The writing style is clear, witty and erudite. "The Art of Computer Programming" is a must read. The books per se are very well done: paper, cover and binding are high quality. They also come in rock solid case, which, however, I do not particularly like as it hard to take out a book when the case is full. I definitively recommend these books to everybody, not just to people into computer programming.
One person found this helpful
Report
Arsenal
5.0 out of 5 stars This is the bible of programming
Reviewed in Canada on May 31, 2020
If you can master the contents in these books. You can get a programming job with any company!
6 people found this helpful
Report