๐”– Scriptorium
โœฆ   LIBER   โœฆ

๐Ÿ“

Algorithms in Java, Parts 1-4 (3rd Edition) (Pts.1-4)

โœ Scribed by Robert Sedgewick


Publisher
Addison-Wesley Professional
Year
2002
Tongue
English
Leaves
768
Edition
3
Category
Library

โฌ‡  Acquire This Volume

No coin nor oath required. For personal study only.

โœฆ Synopsis


[...]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.


๐Ÿ“œ SIMILAR VOLUMES


Algorithms in C, Parts 1-4: Fundamentals
โœ Robert Sedgewick ๐Ÿ“‚ Library ๐Ÿ“… 1997 ๐Ÿ› AW ๐ŸŒ English

"This is an eminently readable book which an ordinary programmer, unskilled in mathematical analysis and wary of theoretical algorithms, ought to be able to pick up and get a lot out of.."- Steve Summit, author of C Programming FAQs Sedgewick has a real gift for explaining concepts in a way that ma

Algorithms in Java, Part 5: Graph Algori
โœ Robert Sedgewick ๐Ÿ“‚ Library ๐Ÿ“… 2003 ๐Ÿ› Addison-Wesley Professional ๐ŸŒ English

[...]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

Algorithms in Java, Part 5: Graph Algori
โœ Robert Sedgewick ๐Ÿ“‚ Library ๐Ÿ“… 2003 ๐Ÿ› Addison-Wesley Professional ๐ŸŒ English

[...]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

Algorithms in Java, Third Edition, Parts
โœ Sedgewick, Robert;Schidlowsky, Michael ๐Ÿ“‚ Library ๐Ÿ“… 2002 ๐Ÿ› Addison-Wesley Professional ๐ŸŒ English

By blending theory and practice, this book appeals equally to both the academic and professional markets. For the first time, Sedgewick's seminal work on algorithms and data structures is available with implementations in Java. The author has developed new Java code that both expresses the methods i

Algorithms in Java, Parts 1-4
โœ Sedgewick, Robert ๐Ÿ“‚ Library ๐Ÿ“… 2002 ๐Ÿ› Pearson Education Limited (US titles);Addison Wesl ๐ŸŒ English

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 reade

Algorithms in Java, Parts 1-4
โœ Robert Sedgewick ๐Ÿ“‚ Library ๐Ÿ“… 2002 ๐Ÿ› Addison-Wesley Professional ๐ŸŒ English

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 reade