Bild 1 von 2


Galerie
Bild 1 von 2


Die Kunst der Computerprogra mmierung: Band 3: Sortieren und Suchen 2.
US $19,99
Ca.CHF 16,22
Artikelzustand:
Neu
Neues, ungelesenes, ungebrauchtes Buch in makellosem Zustand ohne fehlende oder beschädigte Seiten. Genauere Einzelheiten entnehmen Sie bitte dem Angebot des Verkäufers.
Oops! Looks like we're having trouble connecting to our server.
Refresh your browser window to try again.
Versand:
Kostenlos USPS Media MailTM.
Standort: Johnstown, Colorado, USA
Lieferung:
Lieferung zwischen Fr, 20. Jun und Do, 26. Jun nach 94104 bei heutigem Zahlungseingang
Rücknahme:
Keine Rücknahme.
Zahlungen:
Sicher einkaufen
Der Verkäufer ist für dieses Angebot verantwortlich.
eBay-Artikelnr.:126914325294
Artikelmerkmale
- Artikelzustand
- Brand
- Unbranded
- Book Title
- The Art of Computer Programming: Volume 3: Sorting and Searching
- MPN
- Does not apply
- ISBN
- 9780201896855
Über dieses Produkt
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
Artikelbeschreibung des Verkäufers
Info zu diesem Verkäufer
Golorado
100% positive Bewertungen•990 Artikel verkauft
Angemeldet als privater VerkäuferDaher finden verbraucherschützende Vorschriften, die sich aus dem EU-Verbraucherrecht ergeben, keine Anwendung. Der eBay-Käuferschutz gilt dennoch für die meisten Käufe.
Verkäuferbewertungen (337)
- 0***_ (138)- Bewertung vom Käufer.Letzter MonatBestätigter KaufFast shipping and item came exactly shown as pictures
- w***r (132)- Bewertung vom Käufer.Letzter MonatBestätigter KaufThank you. Fast delivery and reliable packaging.
- r***l (584)- Bewertung vom Käufer.Letzte 6 MonateBestätigter KaufTHANK YOU SO MUCH FOR THE RETURN .. I WAS SO SAD IT WAS DAMAGED .. BUT I DID FIND ONEHP Envy 110 E-All-in-one Printer D411 Model SNPRH-1101 (Nr. 126891275985)
Noch mehr entdecken:
- Erwachsene Masters of the Universe Hörbücher und Hörspiele,
- Masters of the Universe Jugendliche Hörbücher und Hörspiele,
- Masters of the Universe Jugendliche Hörbücher und Hörspiele,
- Erwachsene Masters of the Universe Hörbücher und Hörspiele,
- Masters of the Universe Buchreihe Hörbücher und Hörspiele auf Deutsch,
- Ungekürzte Masters of the Universe Buchreihe Hörbücher und Hörspiele,
- Masters of the Universe Buchreihe Hörbücher und Hörspiele auf Englisch,
- Masters of the Universe Buchreihe Kassette Hörbücher und Hörspiele mit Kinder- & Jugendliteratur,
- Computer & Internetliteratur über Programmiersprache,
- Computer & Internetliteratur über Web & Internet