Algorithms in Java, Parts 1-4 (3rd Edition): Pts.1-4 und über 1,5 Millionen weitere Bücher verfügbar für Amazon Kindle. Erfahren Sie mehr

Neu kaufen

oder
Loggen Sie sich ein, um 1-Click® einzuschalten.
Gebraucht kaufen
Gebraucht - Gut Informationen anzeigen
Preis: EUR 18,55

oder
 
   
Jetzt eintauschen
und EUR 7,50 Gutschein erhalten
Eintausch
Alle Angebote
Möchten Sie verkaufen? Hier verkaufen
Der Artikel ist in folgender Variante leider nicht verfügbar
Keine Abbildung vorhanden für
Farbe:
Keine Abbildung vorhanden

 
Beginnen Sie mit dem Lesen von Algorithms in Java, Parts 1-4 (3rd Edition): Pts.1-4 auf Ihrem Kindle in weniger als einer Minute.

Sie haben keinen Kindle? Hier kaufen oder eine gratis Kindle Lese-App herunterladen.

Algorithms in Java, Parts 1-4 [Englisch] [Taschenbuch]

Robert Sedgewick

Preis: EUR 55,76 kostenlose Lieferung. Siehe Details.
  Alle Preisangaben inkl. MwSt.
o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o o
Derzeit nicht auf Lager.
Bestellen Sie jetzt und wir liefern, sobald der Artikel verfügbar ist. Sie erhalten von uns eine E-Mail mit dem voraussichtlichen Lieferdatum, sobald uns diese Information vorliegt. Ihr Konto wird erst dann belastet, wenn wir den Artikel verschicken.
Verkauf und Versand durch Amazon. Geschenkverpackung verfügbar.

Weitere Ausgaben

Amazon-Preis Neu ab Gebraucht ab
Kindle Edition EUR 26,67  
Taschenbuch EUR 55,76  
Dieses Buch gibt es in einer neuen Auflage:
Algorithms Algorithms
Derzeit nicht verfügbar.

Kurzbeschreibung

5. August 2002 Algorithms in Java
For the first time, Sedgewick's seminal work on algorithms and data structures is available with implementations in Java. Michael Schidlowsky and Sedgewick have developed new Java code that both expresses the methods in a concise and direct manner, and also provides programmers with the practical means to test them on real applications. This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. Its four parts are fundamentals, data structures, sorting, and searching. It has expanded coverage of arrays, linked lists, strings, trees, ADT's, and object-oriented programming.

Hinweise und Aktionen

  • Amazon Trade-In: Tauschen Sie Ihre gebrauchten Bücher gegen einen Amazon.de Gutschein ein - wir übernehmen die Versandkosten. Jetzt eintauschen


Wird oft zusammen gekauft

Algorithms in Java, Parts 1-4 + Algorithms in Java: Part 5, Graph Algorithms
Preis für beide: EUR 96,66

Einer der beiden Artikel ist schneller versandfertig.

Die ausgewählten Artikel zusammen kaufen

Kunden, die diesen Artikel angesehen haben, haben auch angesehen


Produktinformation


Mehr über den Autor

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

Produktbeschreibungen

Synopsis

For the first time, Sedgewick's seminal work on algorithms and data structures is available with implementations in Java. Michael Schidlowsky and Sedgewick have developed new Java code that both expresses the methods in a concise and direct manner, and also provides programmers with the practical means to test them on real applications. This particular book, Parts 1-4, represents the essential first half of Sedgewick's complete work. Its four parts are fundamentals, data structures, sorting, and searching. It has expanded coverage of arrays, linked lists, strings, trees, ADT's, and object-oriented programming.

Buchrückseite

Sedgewick has a real gift for explaining concepts in a way that makes them easy to understand. The use of real programs in page-size (or less) chunks that can be easily understood is a real plus. The figures, programs, and tables are a significant contribution to the learning experience of the reader; they make this book distinctive.
--William A. Ward, University of South Alabama

This edition of Robert Sedgewick's popular work provides current and comprehensive coverage of important algorithms for Java programmers. Michael Schidlowsky and Sedgewick have developed new Java implementations that both express the methods in a concise and direct manner and provide programmers with the practical means to test them on real applications.

Many new algorithms are presented, and the explanations of each algorithm are much more detailed than in previous editions. A new text design and detailed, innovative figures, with accompanying commentary, greatly enhance the presentation. The third edition retains the successful blend of theory and practice that has made Sedgewick's work an invaluable resource for more than 400,000 programmers!

This particular book, Parts 1-4 , represents the essential first half of Sedgewick's complete work. It provides extensive coverage of fundamental data structures and algorithms for sorting, searching, and related applications. Although the substance of the book applies to programming in any language, the implementations by Schidlowsky and Sedgewick also exploit the natural match between Java classes and abstract data type (ADT) implementations.

    Highlights
  • Java class implementations of more than 100 important practical algorithms
  • Emphasis on ADTs, modular programming, and object-oriented programming
  • Extensive coverage of arrays, linked lists, trees, and other fundamental data structures
  • Thorough treatment of algorithms for sorting, selection, priority queue ADT implementations, and symbol table ADT implementations (search algorithms)
  • Complete implementations for binomial queues, multiway radix sorting, randomized BSTs, splay trees, skip lists, multiway tries, B trees, extendible hashing, and many other advanced methods
  • Quantitative information about the algorithms that gives you a basis for comparing them
  • More than 1,000 exercises and more than 250 detailed figures to help you learn properties of the algorithms

Whether you are learning the algorithms for the first time or wish to have up-to-date reference material that incorporates new programming styles with classic and new algorithms, you will find a wealth of useful information in this book.



0201361205B08282002


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


Kundenrezensionen

Es gibt noch keine Kundenrezensionen auf Amazon.de
5 Sterne
4 Sterne
3 Sterne
2 Sterne
1 Sterne
Die hilfreichsten Kundenrezensionen auf Amazon.com (beta)
Amazon.com: 3.6 von 5 Sternen  7 Rezensionen
17 von 17 Kunden fanden die folgende Rezension hilfreich
3.0 von 5 Sternen `Algorithms in Java' aka `How little code does it take to confuse people?' 9. Februar 2006
Von A. Flamholz - Veröffentlicht auf Amazon.com
Format:Taschenbuch
I have the dubious distinction of having taken a class that used this book as it's central text. The illustrations are great. The explanations of algorithms and general algorithm design concepts are clear. The code, however, is neigh unreadable in a lot of places.

This was a huge problem for me, as I had a lot of difficulty seeing a clear mapping from the concepts explained to the code examples. Sedgwick's code examples often build on previous ones to the degree that they are not understandable on their own (this is especially true with the graph algorithms in part 5). If you try to use this book as a reference you will find yourself digging much harder than you would like in order to understand code samples that are actually quite simple. You could see how this might make a programming based course difficult.
19 von 20 Kunden fanden die folgende Rezension hilfreich
2.0 von 5 Sternen Not a gifted writer 13. Februar 2007
Von mathboy - Veröffentlicht auf Amazon.com
Format:Taschenbuch
[...]I have at least half of both volumes, and it really seems to me that there are real problems here with the exposition. Let me see if I can elaborate.

Here is an actual sentence from the book-

We construct a symbol table that is made up of an ordered array of keys, except that we keep in that array not the key, but an index into the text string that points to the first character of the key.

Consider that there are two possible conflicting meanings of the sentence fragment :

...an index into the text string that points to the first character of the key.

In the first meaning, there is an index that points to the first character of a string which string has the property that it, in its turn "points to the first character of the key". (a String is engaged in pointing and so in the index.)

In the second meaning, there is an index that points (into) a text string and in fact that index points into the FIRST CHARACTER of that text string, and that first character the index is pointing to, well, that is the also first character of the key. (only the index is pointing; the string pointeth not.)

OK so how do you describe what's missing here? At least the disambiguating use of commas, at least. It's as though he likes to write in subordinate clauses, but thinks it's economical to leave out the punctuation (which, it is true, there are no hard and fast rules for).

So it's just sentence after sentence after sentence like that. Sometimes you can understand what he's saying. Other times, really you just can't. IF each sentence has 2 (or more!) possible interpretations, and each sentence depends on your understanding the last (as is the case- he never says the same thing in two different ways), then you get this ambiguity growing at the alarming rate of x^2, an observation the author might enjoy.

As the other reviewers said, the code is a C programmers attempt to write in Java. This never goes well.....

But the fact remains it is still the most accessible and thorough coverage of some of its subjects. So what are you going to do?

I don't get the impression he is deliberately bartering in obscuratism, it's just that this book suffers (and so will you) from a lack of editing, a lack of reviewing and feedback by genuine, unaided learners etc. etc.

You might want to check other people's lists for alternatives. Or not. Perhaps that passage was perfectly clear to you.
0 von 2 Kunden fanden die folgende Rezension hilfreich
4.0 von 5 Sternen Popular book 23. August 2013
Von Partha Dhara - Veröffentlicht auf Amazon.com
Format:Kindle Edition|Verifizierter Kauf
Books by Robert Sedgewick is highly recommended for student. I feel if somebody wishes to digest the Knuth's work, this book might be a very good starting point.
4 von 9 Kunden fanden die folgende Rezension hilfreich
5.0 von 5 Sternen Thorough, well written and illustrated, excellent 29. Dezember 2004
Von Jack D. Herrington - Veröffentlicht auf Amazon.com
Format:Taschenbuch
This is an excellent book. Robert does a great job leading you through the fundamentals of algorithms and algorithm analysis. The visualizations are very well done. In particular the sort algorithm coverage is very well illustrated and described.

The best parts of the book are sorting and searching. A wide variety of algorithms are explained and demonstrated in detail. The code is solid and the writing is very good.

This is the set of Java algorithms books.
8 von 36 Kunden fanden die folgende Rezension hilfreich
1.0 von 5 Sternen Long on theory, Zero on practical examples 8. Juli 2004
Von Ein Kunde - Veröffentlicht auf Amazon.com
Format:Taschenbuch
After reading the glowing reviews from the other folk here, I was a little excited about this book. It was the text chosen by my college for a class in Algorithm Development. My excitement quickly turned to disdain after reading a few chapters. Theory and performance data are covered very extensively, and for that, I applaud the writers. But what is missing for me is practical examples of where you would use the algorithms presented! Try as I might, I couldn't find any real-world examples for any of the algorithms. Maybe I learn differently than everybody else, but examples go a LONG way in helping me understand things.
Waren diese Rezensionen hilfreich?   Wir wollen von Ihnen hören.

Kunden diskutieren

Das Forum zu diesem Produkt
Diskussion Antworten Jüngster Beitrag
Noch keine Diskussionen

Fragen stellen, Meinungen austauschen, Einblicke gewinnen
Neue Diskussion starten
Thema:
Erster Beitrag:
Eingabe des Log-ins
 

Kundendiskussionen durchsuchen
Alle Amazon-Diskussionen durchsuchen
   


Ähnliche Artikel finden


Ihr Kommentar