BIBLIO is the largest independent book marketplace in the world, with over 100 million books.

Skip to content

Art of Computer Programming, The: Sorting and Searching, Volume 3

Art of Computer Programming, The: Sorting and Searching, Volume 3

Art of Computer Programming, The: Sorting and Searching, Volume 3
Stock photo: cover may vary

Art of Computer Programming, The: Sorting and Searching, Volume 3 Hardback - 1998

by Knuth, Donald

Add to wish list
  • Used
  • Good
  • Hardback
Used - Good

Description

hardcover. Good. Access codes and supplements are not guaranteed with used items. May be an ex-library book.
Ask the seller a question Add to wish list
A$72.66
Free Delivery within USA
Standard delivery: 7 to 14 days
More delivery options
Dropship order
Ships from Bonita (California, United States)

Details

  • Title Art of Computer Programming, The: Sorting and Searching, Volume 3
  • Author Knuth, Donald
  • Binding Hardback
  • Edition International Ed
  • Condition Used - Good
  • Pages 800
  • Volumes 1
  • Language ENG
  • Publisher Addison-Wesley Professional, U.S.A.
  • Publication date April 24, 1998
  • Features Dust Cover, Index, Table of Contents
  • Bookseller's Inventory # 0201896850.G
  • 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 Bonita California, United States

Biblio member since 2020

Terms of Sale: 30 day return guarantee, with full refund including original shipping costs for up to 30 days after delivery if an item arrives misdescribed or damaged.

Browse books from Bonita

Reader reviews for Art of Computer Programming, The: Sorting and Searching, Volume 3

From the publisher

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.

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.

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.

tracking-