Most Helpful Customer Reviews
7 of 7 people found the following review helpful:
5.0 out of 5 stars
Excellent book, November 9, 2005
This review is from: Bundle of Algorithms in Java, Third Edition, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5) (Paperback)
First is Knuth, second is Corman that brings the art of algorithms closer to earth. Then is Sedgewick. This book provides very good balance between theory and practice and lets the practitioners know that programming is a bit more than just writing "if" and "for" and that the art of algorithms is not only art but also science. This book evolved from early editions (Algorithms in C, 1990) and keeps the standard. These two volumes is the must for every serious programmer.
Cons: Java code is a bit "C-ish" and makes it clear that it is easy to write C program in Java. In addition, section Geometric Algorithms from 1990 edition and other material following this section is missing in newer editions. Maybe this material will be included in Volume 3, that as rumor says, is in preparation.
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No
7 of 8 people found the following review helpful:
3.0 out of 5 stars
Good Explanations Of Concepts, Poor Coding, November 17, 2008
This review is from: Bundle of Algorithms in Java, Third Edition, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5) (Paperback)
The book is very detailed at explaining various algorithms, efficiencies, and hitting on the advantages and disadvantages of each algorithm. If you read through the chapters sequentially and study them in detail, you will certainly learn a lot about the various algorithms.
However, the examples and code used in the book is impossible to follow. If you wish to implement any of the algorithms, you really just have to write the algorithm yourself - it may even be easier to write it from scratch without even looking at the authors examples. This is NOT a book to go to if you want to type up a given sorting algorithm to use for some purpose. The code is hard to follow due to horrible variable naming, references back to code from previous chapters, relies on code from previous chapters, relies on code that the reader is supposed to write as part of the exercises, etc.
I've been working on trying to get a running copy of my own for Radix sort typed up. I thought I would type up the code in this book. That's not working. I've been at it for a couple hours now and I still am jumping around trying to put together the bits of code scattered throughout the book and understand the variables.
So - this book is for people who are interested in studying and learning about the various algorithms, but not for people who learn best by examples. There is plenty to read on the algorithms and much discussion on how they work and when they work best, but trying to make sense out of the code examples is near impossible.
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No
7 of 8 people found the following review helpful:
5.0 out of 5 stars
More Practical for Programmers Than Cormen's, September 8, 2007
This review is from: Bundle of Algorithms in Java, Third Edition, Parts 1-5: Fundamentals, Data Structures, Sorting, Searching, and Graph Algorithms (3rd Edition) (Pts. 1-5) (Paperback)
These text(s) do for the software engineer what Cormen's book does for the scientist. To be knowledgable with algorithms will greatly seperate you from a novice.
Very good examples and using Java is very smart because most OO programmers can easily understand the language (C# is practically identical).
For those who struggle with the Cormen book, (Like I did) it would do you well to get this book. You will refer to it time and time again in your career as a software developer while the Cormen book collects dust on the shelf.
Help other customers find the most helpful reviews
Was this review helpful to you? Yes
No
|