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

๐Ÿ“

Algorithms in Java

โœ 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 Java, Part 5: Graph Algori
โœ Robert Sedgewick ๐Ÿ“‚ Library ๐Ÿ“… 2003 ๐Ÿ› Addison-Wesley Professional ๐ŸŒ English

Once again, Robert Sedgewick provides a current and comprehensive introduction to important algorithms. The focus this time is on graph algorithms, which are increasingly critical for a wide range of applications, such as network connectivity, circuit design, scheduling, transaction processing, and

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

Text provides a tool set for programmers to implement, debug, and use graph algorithms across a wide range of computer applications. Covers graph properties and types; digraphs and DAGs; minimum spanning trees; shortest paths; network flows; and diagrams, sample Java code, and detailed algorithm des

Data Structures & Algorithms in Java
โœ Mitchell Waite, Robert Lafore ๐Ÿ“‚ Library ๐Ÿ“… 1998 ๐Ÿ› Waite Group Press ๐ŸŒ English

Not filled with with obtuse mathematics and difficult proofs, MWSS:Data Structures and Algorithms in Java removes the mystique from DS&A. It does this in two ways. First, the text is written in a straightforward style, making it accessible to anyone. Second, unique new Java demonstration programs,

Data structures & algorithms in Java
โœ Mitchell Waite, Robert Lafore ๐Ÿ“‚ Library ๐Ÿ“… 1998 ๐Ÿ› Waite Group Press ๐ŸŒ English

Not filled with with obtuse mathematics and difficult proofs, MWSS:Data Structures and Algorithms in Java removes the mystique from DS&A. It does this in two ways. First, the text is written in a straightforward style, making it accessible to anyone. Second, unique new Java demonstration programs,

Data Structures & Algorithms in Java
โœ Mitchell Waite, Robert Lafore ๐Ÿ“‚ Library ๐Ÿ“… 1998 ๐Ÿ› Waite Group Press ๐ŸŒ English

Book was in great condition..but unfortunately it did not come with the accompanying cd ! It's virtually impossible to simulate all these algorithms without the applets(on the cd!).