Picture 1 of 2


Gallery
Picture 1 of 2


Have one to sell?
The Art of Computer Programming: Volume 3: Sorting and Searching 2nd
US $19.99
Approximately£15.14
Condition:
New
A new, unread, unused book in perfect condition with no missing or damaged pages. See the seller's listing for full details.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Postage:
Free USPS Media MailTM.
Located in: Johnstown, Colorado, United States
Delivery:
Estimated between Wed, 6 Aug and Tue, 12 Aug to 94104
Returns:
No returns accepted.
Payments:
Shop with confidence
Seller assumes all responsibility for this listing.
eBay item number:126914325294
Item specifics
- Condition
- Brand
- Unbranded
- Book Title
- The Art of Computer Programming: Volume 3: Sorting and Searching
- MPN
- Does not apply
- ISBN
- 9780201896855
About this product
Product Identifiers
Publisher
Addison Wesley Professional
ISBN-10
0201896850
ISBN-13
9780201896855
eBay Product ID (ePID)
70805
Product Key Features
Number of Pages
800 Pages
Language
English
Publication Name
Art of Computer Programming : Sorting and Searching, Volume 3
Publication Year
1998
Subject
Programming / General, Programming / Algorithms
Features
Revised
Type
Textbook
Subject Area
Computers
Format
Hardcover
Dimensions
Item Height
1.9 in
Item Weight
48 Oz
Item Length
9.4 in
Item Width
6.7 in
Additional Product Features
Edition Number
2
Intended Audience
Scholarly & Professional
LCCN
97-002147
TitleLeading
The
Number of Volumes
4 vols.
Volume Number
Vol. 3
Illustrated
Yes
Edition Description
Revised edition
Table Of Content
5. Sorting. Combinatorial Properties of Permutations. Inversions. Permutations of a Multiset. Runs. Tableaux and Involutions. Internal sorting. Sorting by Insertion. Sorting by Exchanging. Sorting by Selection. Sorting by Merging. Sorting by Distribution. Optimum Sorting. Minimum-Comparison Sorting. Minimum-Comparison Merging. Minimum-Comparison Selection. Networks for Sorting. External Sorting. Multiway Merging and Replacement Selection. The Polyphase Merge. The Cascade Merge. Reading Tape Backwards. The Oscillating Sort. Practical Considerations for Tape Merging. External Radix Sorting. Two-Tape Sorting. Disks and Drums. Summary, History, and Bibliography. 6. Searching. Sequential Searching. Searching by Comparison of Keys. Searching an Ordered Table. Binary Tree Searching. Balanced Trees. Multiway Trees. Digital Searching. Hashing. Retrieval on Secondary Keys. Answers to Exercises. Appendix A: Tables of Numerical Quantities. Fundamental Constants (decimal). Fundamental Constants (octal). Harmonic Numbers, Bernoulli Numbers, Fibonacci Numbers. Appendix B: Index to Notations. Index and Glossary. 0201896850T04062001
Synopsis
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., 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. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP), http: //msp.org, 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. Ebook (PDF version) produced by Mathematical Sciences Publishers (MSP),http://msp.org, 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.
LC Classification Number
QA76.6.K64 1997
Item description from the seller
About this seller
Golorado
100% positive Feedback•996 items sold
Registered as a private sellerThereby, consumer rights stemming from EU consumer protection law do not apply. eBay buyer protection still applies to most purchases.
Seller Feedback (339)
- g***v (124)- Feedback left by buyer.Past 6 monthsVerified purchaseReceiver is as described in add. There was some damage to 2 of the foot pads during shipping. Was able to repair it myself. Happy with the purchase still. Seller did a pretty good packing job on unit.Yamaha RX-V870 AVR (#126891278509)
- 2***n (110)- Feedback left by buyer.Past 6 monthsVerified purchaseItem arrived quickly and exactly as described! Great seller! A+
- 0***_ (144)- Feedback left by buyer.Past 6 monthsVerified purchaseFast shipping and item came exactly shown as picturesBlack Sling Backpack For Meta Quest 3 2 Carrying Case Multi-function Fashion (#126891282812)
More to explore:
- Manga Comic Book Single Volume,
- Non-Fiction Fiction & Neuro-Linguistic Programming Books,
- Non-Fiction Paperback Fiction & Game Programming Books,
- Naruto Manga Comic Book Single Volume,
- Manga & Asian Comic Book Single Volume,
- Manga & Asian Comic Book Single Volume in English,
- Naruto Manga & Asian Comic Book Single Volume,
- TOKYOPOP Manga & Asian Comic Book Single Volume,
- Attack on Titan Manga & Asian Comic Book Single Volume,
- One Piece Manga & Asian Comic Book Single Volume