Buy New
-25%
$300.00$300.00
FREE delivery Monday, October 5
Ships from: Amazon Sold by: Cardinal Plus
Used - Very Good
$7.88$7.88
FREE delivery October 7 - 9
Ships from: ThriftBooks-Chicago Sold by: ThriftBooks-Chicago
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.
Follow the author
OK
The Art of Computer Programming: Sorting and Searching. Volume 3 (Addison Wesley Series in Computer Science and Information Processing)
Purchase options and add-ons
- LanguageEnglish
- PublisherAddison-Wesley
- Publication dateJanuary 1, 1973
- Dimensions1.75 x 6.5 x 9.5 inches
There is a newer edition of this item:
$56.61
(71)
Only 1 left in stock - order soon.
Book recommendations, author interviews, editors' picks, and more. Read it now.
Popular titles by this author
- Concrete Mathematics: A Foundation for Computer Science (2nd Edition)HardcoverFREE Shipping by AmazonGet it as soon as Monday, Oct 5
- Art of Computer Programming, The, Volumes 1-4B, Boxed SetHardcoverFREE Shipping by AmazonGet it as soon as Monday, Oct 5
- Literate Programming (Lecture Notes) (Volume 27)PaperbackFREE Shipping on orders over $35 shipped by AmazonGet it as soon as Monday, Oct 5
- Art of Computer Programming, Volume 4, Fascicle 7, The: Constraint SatisfactionPaperbackFREE Shipping on orders over $35 shipped by AmazonGet it as soon as Monday, Oct 5Only 9 left in stock - order soon.
- Puzzle Box, Volume 2 (Dover Brain Games & Puzzles)Andy ParrPaperbackFREE Shipping on orders over $35 shipped by AmazonGet it as soon as Monday, Oct 5Only 6 left in stock (more on the way).
Product details
- ASIN : 020103803X
- Publisher : Addison-Wesley
- Publication date : January 1, 1973
- Edition : First Edition
- Language : English
- Item Weight : 2.68 pounds
- Dimensions : 1.75 x 6.5 x 9.5 inches
- Best Sellers Rank: #4,831,370 in Books (See Top 100 in Books)
- #16,907 in Computer Software (Books)
- Customer Reviews:
About the author

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
- 5 star4 star3 star2 star1 star3 star65%19%0%0%16%0%
- 5 star4 star3 star2 star1 star2 star65%19%0%0%16%0%
Customer Reviews, including Product Star Ratings help customers to learn more about the product and decide whether it is the right product for them.
To calculate the overall star rating and percentage breakdown by star, we don’t use a simple average. Instead, our system considers things like how recent a review is and if the reviewer bought the item on Amazon. It also analyzed reviews to verify trustworthiness.
Learn more how customers reviews work on AmazonTop reviews from the United States
- 5 out of 5 stars
One of the classics of computer science.
Reviewed in the United States on March 24, 2014More than 30 years after it was written, Searching and Sorting is still the definitive treatise on minimal-step sorting, tree-structures, and everything else Knuth took up.
I'm still reading a first edition copy, and I suppose other people - practical programmers, for instance - would prefer the updated and revised editions. But that's like buying a modern calculus text, rather than reading Newton in the original Latin.
This isn't a "Dummies Guide to....". It doesn't include helpful Windows shortcuts. It wasn't co-sponsored by Microsoft.
But it was written by a genius, struggling with hard problems, and writing with clarity and grace.
5 people found this helpfulSending feedback...Sending feedback...HelpfulThank you for your feedback.Sorry, we failed to record your vote. Please try againThanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport - 5 out of 5 stars
Knuthing wrong with this book!
Reviewed in the United States on January 19, 2015It's just fun to own something that one of the original computer scientists authored.
Sending feedback...Sending feedback...HelpfulThank you for your feedback.Sorry, we failed to record your vote. Please try againThanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport - 4 out of 5 stars
but it has been great to read it to learn the theory behind
Reviewed in the United States on November 23, 2015A classic book if you want to learn about computer programming. The level is way above the basics, since it is more oriented at people that want to learn the theory behind sorting; so if you are a beginner or advanced user that wants to use sorting algorithms, this may be a bit over your head. The code examples are few and generic; plenty of complex math, but really thorough.
I am no fan of such books, but it has been great to read it to learn the theory behind; if you can take the style of the book. I liked more the first volume of the series, but this is good too.
Sending feedback...Sending feedback...HelpfulThank you for your feedback.Sorry, we failed to record your vote. Please try againThanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport
Top reviews from other countries
geraud guibert5 out of 5 starsbien reçu merci
Reviewed in France on November 25, 2023bien reçu merci
Sending feedback...Thanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport
PROF W E STEINMUELLER5 out of 5 starsThis is a brilliant work by a brilliant scholar addressed at the diminishing ...
Reviewed in the United Kingdom on April 15, 2015What to say? This is a brilliant work by a brilliant scholar addressed at the
diminishing audience who see such books as treasure chests and puzzle
palaces to be mastered through a process of adventure and discovery,
Sending feedback...Thanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport
K R Khandelwal1 out of 5 starsNeed revision for silicon valley
Reviewed in India on September 20, 2018This book needs revision and recent algorithm to stand in silicon valley
Sending feedback...Thanks, we'll investigate in the next few days.Sorry, We failed to report this review. Please try againWe'll check if this review meets our community guidelinesOpens in a new tab. If it doesn't, we'll remove it.
CancelReport












