The Art of Computer Programming : Sorting and Searching, Volume 3 Hardback - 1997
by Donald E. Knuth
- Used
- very good
- Hardback
Standard delivery: 7 to 14 days
Details
- Title The Art of Computer Programming : Sorting and Searching, Volume 3
- Author Donald E. Knuth
- Binding Hardback
- Edition Second Edition
- Condition Used - Very good
- Pages 800
- Volumes 1
- Language ENG
- Publisher Addison - Wesley, U.S.A.
- Publication date 1997
- Features Dust Cover, Index, Table of Contents
- Bookseller's Inventory # 0856033
- ISBN 9780201896855 / 0201896850
- Weight 2.9 lbs (1.32 kg)
- Dimensions 9.49 x 6.65 x 1.71 in (24.10 x 16.89 x 4.34 cm)
- Category Computers - Languages / Programming
- Library of Congress subjects Computer programming, Computer algorithms
- Library of Congress Catalogue Number 73001830
- Dewey Decimal Code 005.1
- Quantity available 1
About Vashon Island Books Washington, United States
Vashon Island Books is located on Vashon Island an idylic country setting just a short ferry ride from Downtown Seattle. We are a quality internet bookstore for readers & collectors. We have a select, diverse stock that is constantly changing and growing. We do the majority of our business over the Net and are committed to providing professional service. With 30 plus years combined bookselling experience and knowledge Vashon Island Books provides a trustworthy and respected outlet for your book buying needs
We accept payment via Credit card, check, money order, and *PayPal* (vashonbooks@comcast.net) . Payment with order. Check (US$ only/US Bank), PayPal or Credit Card (Visa, M/C, AMEX. Discover). 7-day return only if not as described (you must notify us immediately on upon receipt of any problem). DJs Brodarted. We pack carefully. Shipping: U.S.: $4.00 1st volume, $2.00 each additional volume via book rate. Priority Mail minimum $7.95 (large/heavy cost more). UPS also available at extra cost.
Reader reviews for The Art of Computer Programming : Sorting and Searching, Volume 3
Write a review for this book
Important Terms and Guidelines
- Please focus on the book’s content and context. Also, add any personal comments as to how you enjoyed the book. Substantiate your likes and dislikes. You may make comparisons to other books.
- Reviews must be at least 140 characters in length.
- Please do not reveal critical plot elements.
- This is not a help line. Contact customer support if you need help.
Your review must not include:
- Obscenities, discriminatory language, or other insulting language not suitable for public domain
- Advertisements, “spam” content, or references to other products, offers or websites.
- Email addresses, URLs, phone numbers, physical addresses or other contact information.
- Overly critical comments about other reviews or reviewers
- Time-sensitive material (i.e. promotional tours, seminars, lectures, etc.)
- Availability, price, or alternative ordering/shipping information
From the publisher
From the rear cover
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.