Title | : | Algorithms in Java, Parts 1-4 |
Author | : | |
Rating | : | |
ISBN | : | 0201361205 |
ISBN-10 | : | 9780201361209 |
Language | : | English |
Format Type | : | Paperback |
Number of Pages | : | 768 |
Publication | : | First published January 1, 2002 |
Algorithms in Java, Parts 1-4 Reviews
-
Highly recommended for anyone with interest in algorithms. While not quite as good as Sedgewick's original work with implementations in C++ this is recommended the ones most familiar with Java
-
Not related to Java. It just uses java as pseudocode. Does not even mention java data structures. From the title was expecting more practical book, not just typical algorithm reference...
-
oh god, most frustrating reading experience in my life, only my teacher (who went to princeton and took Sedgewick's class as an undergrad, and is every bit a geek as his prof) can understand this guy and would choose his book as the textbook for the class; that being said, if you are fast and have a good understanding of java, you should be able to get the hang of the gist of this book pretty quickly, and see that Sedgewick is a smart guy, but the problem is, if you had the knowledge that allows you to understand this book easily, you wouldn't be able to learn much from it; so, as a textbook for lower division computer science classes, this book is really not a good choice
-
An acceptable overview of basic algorithms and data structures, but a poor application of those in the Java development platform.
-
MEH. It has everything it needs to have, but boy the code sure is unnecessarily hard to parse, and the writing is only so-so.
-
Not bad, if you need to quickly review for a silicon valley interview. The 2nd volume (Part 5) on Graph algorithms is more interesting.