![]() Trade In this Item for up to £13.15
Trade in The Art of Computer Programming: Sorting and Searching v. 3: The Classic Work Newly Updated and Revised for an Amazon.co.uk gift card of up to £13.15, which you can then spend on millions of items across the site. Trade-in values may vary (terms apply). Find more products eligible for trade-in.
|
Product details
|
Finally, after a wait of more than thirty-five years, the first part of Volume 4 is at last ready for publication. Check out the boxed set that brings together Volumes 1 - 4A in one elegant case, and offers the purchaser a $50 discount off the price of buying the four volumes individually.
The Art of Computer Programming, Volumes 1-4A Boxed Set, 3/e
ISBN: 0321751043
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
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
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
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
The first revision of this third volume is the most comprehensive survey of classical computer techniques for sorting and searching. It extends the treatment of data structures in Volume 1 to consider both large and small databases and internal and external memories. The book contains a selection of carefully checked computer methods, with a quantitative analysis of their efficiency. Outstanding features of the second edition include a revised section on optimum sorting and new discussions of the theory of permutations and of universal hashing.
Tags Customers Associate with This Product(What's this?)Click on a tag to find related items, discussions, and people.
|
|
Share your thoughts with other customers:
|
||||||||||||||||||||||
|
Most Helpful Customer Reviews
6 of 6 people found the following review helpful:
5.0 out of 5 stars
The best known source of seaching and sorting algorithms,
By A Customer
This review is from: The Art of Computer Programming: Sorting and Searching v. 3: The Classic Work Newly Updated and Revised (Hardcover)
This book in a keystone work of computer science. Now and then one needs a "binary search" or a related algorithm, and Knuth's book has it. Such algorithms, although basic, are notoriously easy to get wrong. The style of writing requires the reader to have some mathematics and programming background. Otherwise a reader will need to study the writing style and algorithm description.
Computer Scientists are waiting for this skilled practitioner to finish his life's work, namely Vols. 4-7. Let us hope the author has the patience and time to accomplish it.
3 of 3 people found the following review helpful:
5.0 out of 5 stars
The best reference for all programmers in all levels,
By A Customer
This review is from: The Art of Computer Programming: Sorting and Searching v. 3: The Classic Work Newly Updated and Revised (Hardcover)
The book is quite beneficial for all programmers in all ages. Not only the foundations of the programmer be improved, some techniques are also introduced in the best fashion yet.
1 of 1 people found the following review helpful:
5.0 out of 5 stars
Just try sorting and searching with out this book.,
By
This review is from: The Art of Computer Programming: Sorting and Searching v. 3: The Classic Work Newly Updated and Revised (Hardcover)
I just bought the book I needed out of the set. I needed to build a database that did not use any commercial package (this gives full access and no royalties). This book saved my bacon. I almost did not buy it when all I saw in it was math. But I was desperate and it paid off. Turns out you could not explain it any other way. I use it primarily for balanced trees. I may try some thing more exotic later. I can not tell you about the other volumes but this one will defiantly pay for it's self.
Share your thoughts with other customers: Create your own review
Would you like to see more reviews about this item?
|
Most Recent Customer Reviews |
|