algorithms

I've to buy this book because it is a compulsory text in my Intro. to Data Structures class. After I've read almost of it here are things I found.

The good:

-lots of analysis about advantage and disadvantage in each algorithm (especially in sorting).

-various and good idea in example implementation such as using tree traversal to evaluate expression or the use of disjoint set in making maze! (I like it.)

The bad :

-deep (and too much) mathemetical analysis in each data type and algorithm, is sometimes too hard to understand (and may be not necessary for me at all).

-no context describing basic Java (e.g. How to compile java code; concept about method, object, instance, class).

-after all, I think it costs too expensive for black and white text and poor illustration.

After reading the book, I believe it is intended for those who possess the knowledge of the Java programming language and who wish to obtain a thorough, in-depth knowledge of data structures, algorithms, and algorithm analysis.

I used this book as a supplementary material in a graduate course on Algorithms, and I found that the book's explanations of the algorithms and their analysis are concise, easy-to-understand, and fairly complete. Complicated concepts are explained clearly and illustrated with appropriate examples.

Nevertheless, I would not recommend this book for beginners or for those who are not interested in having a thorough understanding of algorithms.

All of the practical algorithms are left as un-answered exercises! Great in depth discussion of introductory algorithms, but very few examples, mostly pseudo-code.

INFURIATING FOR INDEPENDENT STUDY, but good if you have a professor to explain everything as you go.