Average Reviews:
(More customer reviews)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.
Click Here to see more reviews about: Algorithms in Java, Parts 1-4 (3rd Edition) (Pts.1-4)
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.
Get 40% OFF
Click here for more information about Algorithms in Java, Parts 1-4 (3rd Edition) (Pts.1-4)
No comments:
Post a Comment