The Art of Computer Programming: Volume 3, The: Sorting a... und über 1,5 Millionen weitere Bücher verfügbar für Amazon Kindle. Erfahren Sie mehr
  • Alle Preisangaben inkl. MwSt.
Nur noch 6 auf Lager (mehr ist unterwegs).
Verkauf und Versand durch Amazon.
Geschenkverpackung verfügbar.
Menge:1
The Art of Computer Progr... ist in Ihrem Einkaufwagen hinzugefügt worden
+ EUR 3,00 Versandkosten
Gebraucht: Sehr gut | Details
Verkauft von MEDIMOPS
Zustand: Gebraucht: Sehr gut
Kommentar: medimops: schnell, sicher und zuverlässig
Ihren Artikel jetzt
eintauschen und
EUR 9,20 Gutschein erhalten.
Möchten Sie verkaufen?
Zur Rückseite klappen Zur Vorderseite klappen
Anhören Wird wiedergegeben... Angehalten   Sie hören eine Probe der Audible-Audioausgabe.
Weitere Informationen
Dieses Bild anzeigen

The Art of Computer Programming 3. Sorting and Searching: The Classic Work Newly Updated and Revised (Englisch) Gebundene Ausgabe – 23. Juni 1998


Alle 3 Formate und Ausgaben anzeigen Andere Formate und Ausgaben ausblenden
Amazon-Preis Neu ab Gebraucht ab
Kindle Edition
"Bitte wiederholen"
Gebundene Ausgabe
"Bitte wiederholen"
EUR 75,01
EUR 75,01 EUR 34,06
Taschenbuch
"Bitte wiederholen"
EUR 119,90
4 neu ab EUR 75,01 5 gebraucht ab EUR 34,06

Wird oft zusammen gekauft

The Art of Computer Programming 3. Sorting and Searching: The Classic Work Newly Updated and Revised + The Art of Computer Programming 1. Fundamental Algorithms (Kluwer International Series in) + Art of Computer Programming, Volume 2: Seminumerical Algorithms
Preis für alle drei: EUR 202,99

Die ausgewählten Artikel zusammen kaufen
Jeder kann Kindle Bücher lesen — selbst ohne ein Kindle-Gerät — mit der KOSTENFREIEN Kindle App für Smartphones, Tablets und Computer.


Produktinformation

  • Gebundene Ausgabe: 780 Seiten
  • Verlag: Addison Wesley; Auflage: 2. A. (23. Juni 1998)
  • Sprache: Englisch
  • ISBN-10: 0201896850
  • ISBN-13: 978-0201896855
  • Größe und/oder Gewicht: 17,3 x 4,8 x 23,6 cm
  • Durchschnittliche Kundenbewertung: 4.8 von 5 Sternen  Alle Rezensionen anzeigen (4 Kundenrezensionen)
  • Amazon Bestseller-Rang: Nr. 216.874 in Fremdsprachige Bücher (Siehe Top 100 in Fremdsprachige Bücher)
  • Komplettes Inhaltsverzeichnis ansehen

Mehr über den Autor

Entdecken Sie Bücher, lesen Sie über Autoren und mehr

Produktbeschreibungen

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.

Buchrückseite

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.




Welche anderen Artikel kaufen Kunden, nachdem sie diesen Artikel angesehen haben?


In diesem Buch (Mehr dazu)
Ausgewählte Seiten ansehen
Buchdeckel | Copyright | Inhaltsverzeichnis | Auszug | Stichwortverzeichnis
Hier reinlesen und suchen:

Kundenrezensionen

4.8 von 5 Sternen
5 Sterne
3
4 Sterne
1
3 Sterne
0
2 Sterne
0
1 Sterne
0
Alle 4 Kundenrezensionen anzeigen
Sagen Sie Ihre Meinung zu diesem Artikel

Die hilfreichsten Kundenrezensionen

10 von 10 Kunden fanden die folgende Rezension hilfreich Von Alen Lovrencic am 22. Dezember 1999
Format: Gebundene Ausgabe
This book is bible of computer programming.
It contains most detailed explanation of searching and sorting methods I ever found in a book. Contains all internal sorting and searching and external sorting and searching algorithms.
The only drawback of the book is that all algorithms are written in MIX - some kind of assembler, and because of that they are hard to read.
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen
2 von 2 Kunden fanden die folgende Rezension hilfreich Von bernie am 30. Oktober 2005
Format: Gebundene Ausgabe
I just bought the book I needed out of the set. I needed to build a database that did not use any commercial package (this gives full access and no royalties). This book saved my bacon. I almost did not buy it when all I saw in it was math. But I was desperate and it paid off. Turns out you could not explain it any other way. This book goes way beyond binary, and bubble sorts. I use it primarily for balanced trees. I may try some thing more exotic later. I can not tell you about the other volumes but this one will defiantly pay for it's self.
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen
2 von 4 Kunden fanden die folgende Rezension hilfreich Von Ein Kunde am 30. August 1997
Format: Gebundene Ausgabe
The book is quite beneficial for all programmers in all ages. Not only the foundations of the programmer be improved, some techniques are also introduced in the best fashion yet
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen
1 von 10 Kunden fanden die folgende Rezension hilfreich Von Harold H. Seward (oxfund@msn.com) am 28. November 1997
Format: Gebundene Ausgabe
As the inventor of numerous algorithms described in Prof. Knuth's Vol. 3, 1st edition, I am very interested in his 2nd edition, when available. My 1956 MIT thesis, "Information Sorting in the Application of Electronic Digital Computers to Business Operations," was very well treated in his first edition in 1973. I anxiously await his 2nd.
Kommentar War diese Rezension für Sie hilfreich? Ja Nein Feedback senden...
Vielen Dank für Ihr Feedback. Wenn diese Rezension unangemessen ist, informieren Sie uns bitte darüber.
Wir konnten Ihre Stimmabgabe leider nicht speichern. Bitte erneut versuchen

Die hilfreichsten Kundenrezensionen auf Amazon.com (beta)

Amazon.com: 11 Rezensionen
21 von 21 Kunden fanden die folgende Rezension hilfreich
What's old is new again 4. November 2006
Von wiredweird - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe Verifizierter Kauf
First the basics: it's great, it provides wide-ranging and deep analysis, it shows many views and variants of each problem, and its bibliography is helpful, though not exhaustive. The historical notes, including sorts for drum storage, may seem quaint to modern readers. And sorting has been done, right? You just run a shell program or call a function, and tap into the best technology. Does it need to be done again?

Yes, if you're on the edge of technology, it does need to be done again, and again, and again. That's because technology keeps expanding, and violating old assumptions as it does. Memories got big enough that the million-record sort is now a yawn, where it used to be a journal article. But, at the same time, processor clocks got 100-1000x ahead of memory speeds. All of a sudden, those drum-based algorithms are worth another look, because yesteryear's drum:memory ratios are a lot like today's memory:cache ratios of size and speed - and who doesn't want a 100x speedup? Parallel processing is moving from the supercomputing elite into laptops, causing more tremors in the ground rules. GPU and reconfigurable computing also open whole new realms of pitfalls as well as opportunities.

Knuth points out that the analyses have beauty in themselves, for people with eyes to see it. His analyses also demonstrate techniques applicable way beyond the immediate discussion, too. Today, though, I have nasty problems in technologies that no one really knows how to handle very well. I have to go back and check all the assumptions again, since so many of them changed. If that's the kind of problem you have, too, then this is the place to start.

//wiredweird
11 von 13 Kunden fanden die folgende Rezension hilfreich
The best known source of seaching and sorting algorithms 23. März 1997
Von Ein Kunde - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe
This book in a keystone work of computer science. Now and then one needs a "binary search" or a related algorithm, and Knuth's book has it. Such algorithms, although basic, are notoriously easy to get wrong. The style of writing requires the reader to have some mathematics and programming background. Otherwise a reader will need to study the writing style and algorithm description.

Computer Scientists are waiting for this skilled practitioner to finish his life's work, namely Vols. 4-7. Let us hope the author has the patience and time to accomplish it.
1 von 1 Kunden fanden die folgende Rezension hilfreich
Just try sorting and searching with out this book 3. August 2004
Von bernie - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe
I just bought the book I needed out of the set. I needed to build a database that did not use any commercial package (this gives full access and no royalties). This book saved my bacon. I almost did not buy it when all I saw in it was math. But I was desperate and it paid off. Turns out you could not explain it any other way. This book goes way beyond binary, and bubble sorts. I use it primarily for balanced trees. I may try some thing more exotic later. I can not tell you about the other volumes but this one will defiantly pay for its self.

Art of Computer Programming, The, Volumes 1-3 Boxed Set (2nd Edition) (The Art of Computer Programming Series) (Vol 1-3)
17 von 25 Kunden fanden die folgende Rezension hilfreich
Legendary book 22. Dezember 1999
Von Alen Lovrencic - Veröffentlicht auf Amazon.com
Format: Gebundene Ausgabe
This book is bible of computer programming.
It contains most detailed explanation of searching and sorting methods I ever found in a book. Contains all internal sorting and searching and external sorting and searching algorithms.
The only drawback of the book is that all algorithms are written in MIX - some kind of assembler, and because of that they are hard to read.
More approachable than you probably think. Try it. 23. Oktober 2014
Von Josh Berry - Veröffentlicht auf Amazon.com
Format: Kindle Edition Verifizierter Kauf
I can not make the claim that I have fully worked the exercises. Indeed, I have sadly barely touched them. However, I do feel like I learned something from this book every time I picked it up.

The writing style remains much more approachable than you probably think it is. Specifically, even the heavy math sections are fun to read through as an interested programmer. Sure, it is intimidating in that I don't think I fully followed the thought process on many sections on my first read through. However, coming back and trying multiple times usually left me feeling like I at least understood what was being discussed. Even if I'm not quite sure, yet, that I could have hit on some of these ideas myself.

The section at the end on searching on secondary keys is a true delight. Just plain fun to consider the different tricks that can be done with data.
Waren diese Rezensionen hilfreich? Wir wollen von Ihnen hören.