Foto 1 di 2


Galleria
Foto 1 di 2


The Art of Computer Programming: Volume 3: Sorting and Searching 2nd
US $19,99
CircaEUR 17,26
Condizione:
Nuovo
Libro nuovo, intatto e non letto, in perfette condizioni, senza pagine mancanti o danneggiate. Per maggiori dettagli, consulta l'inserzione del venditore.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Spedizione:
Gratis USPS Media MailTM.
Oggetto che si trova a: Johnstown, Colorado, Stati Uniti
Consegna:
Consegna prevista tra il mar 17 giu e il mar 24 giu a 94104
Restituzioni:
Restituzioni non accettate.
Pagamenti:
Fai shopping in tutta sicurezza
Il venditore si assume la piena responsabilità della messa in vendita dell'oggetto.
Numero oggetto eBay:126914325294
Specifiche dell'oggetto
- Condizione
- Brand
- Unbranded
- Book Title
- The Art of Computer Programming: Volume 3: Sorting and Searching
- MPN
- Does not apply
- ISBN
- 9780201896855
Informazioni su questo prodotto
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
Publication Name
Art of Computer Programming : Sorting and Searching, Volume 3
Language
English
Subject
Programming / General, Programming / Algorithms
Publication Year
1998
Features
Revised
Type
Textbook
Subject Area
Computers
Format
Hardcover
Dimensions
Item Height
1.6 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
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
Edition Description
Revised edition
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. 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., 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
Descrizione dell'oggetto fatta dal venditore
Informazioni su questo venditore
Golorado
100% di Feedback positivi•990 oggetti venduti
Registrato come venditore privatoPertanto non si applicano i diritti dei consumatori derivanti dalla normativa europea. La Garanzia cliente eBay è comunque applicabile alla maggior parte degli acquisti. Scopri di piùScopri di più
Feedback sul venditore (337)
- g***v (121)- Feedback lasciato dall'acquirente.Ultimi 6 mesiAcquisto verificatoReceiver 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.
- 0***_ (138)- Feedback lasciato dall'acquirente.Mese scorsoAcquisto verificatoFast shipping and item came exactly shown as pictures
- w***r (131)- Feedback lasciato dall'acquirente.Mese scorsoAcquisto verificatoThank you. Fast delivery and reliable packaging.
Vedi altro:
- Libri e riviste di narrativa The Walking Dead,
- Libri e riviste di narrativa The Walking Dead in italiano,
- Libri e riviste di narrativa The Walking Dead in inglese,
- Libri e riviste di narrativa copertine rigide The Walking Dead,
- Narrativa per bambini e ragazzi da 3 a 8 anni,
- Saggistica per bambini e ragazzi da 3 a 8 anni, tema italiani,
- Saggistica per bambini e ragazzi da 3 a 8 anni in italiano,
- Narrativa per bambini e ragazzi ragazzi da 3 a 8 anni in italiano,
- Libri e riviste prima edizione per bambini e ragazzi da 3 a 8 anni,
- Libri e riviste per bambini e ragazzi da 3 a 8 anni, tema italiani