- Ausgewählte Leseempfehlungen des Monats
Entdecken Sie monatlich wechselnde außergewöhnliche Leseempfehlungen aus den Genres Thriller, Krimis, Frauenromane, Liebesromane, historische Romane und Humor.
- Entdecken Sie die aktuellen BILD Bestseller. Jede Woche neu. Hier klicken
- Entdecken Sie die Empfehlungen des Amazon Buchteams: eine ausgewählte Auswahl an Romanen, Krimis, Kinderbüchern, Kochbüchern, Ratgebern, Biografien und englischsprachiger Bücher. Hier klicken
Algorithms in Java, Parts 1-4 (Englisch) Taschenbuch – 2002
Hinweise und Aktionen
Kunden, die diesen Artikel angesehen haben, haben auch angesehen
Welche anderen Artikel kaufen Kunden, nachdem sie diesen Artikel angesehen haben?
Es wird kein Kindle Gerät benötigt. Laden Sie eine der kostenlosen Kindle Apps herunter und beginnen Sie, Kindle-Bücher auf Ihrem Smartphone, Tablet und Computer zu lesen.
Geben Sie Ihre Mobiltelefonnummer ein, um die kostenfreie App zu beziehen.
Wenn Sie dieses Produkt verkaufen, möchten Sie über Seller Support Updates vorschlagen?
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. Contents same as US/UK editions.
|5 Sterne (0%)|
|4 Sterne (0%)|
|3 Sterne (0%)|
|2 Sterne (0%)|
|1 Stern (0%)|
Die hilfreichsten Kundenrezensionen auf Amazon.com
The analysis sections and graphics are nice. The little side tables are handy.
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.
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.
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.