Finally a sensible remake of the classic

Yes, the "Sedgewick" - for over 25 years, the classics when it comes to algorithms and data structures. The first edition appeared in 1990 and offered a sound, excellent readable, clearly structured and actionable implementation, with full implementations in C. In 1998, the book has been updated to C ++ in 2003 then in Java. The C ++ - version I do not know, but the Java version has very disappointed me. Firstly, the range of topics much more limited than in the original was - algorithms for strings, for geometry and mathematics were missing completely -, on the other hand the Java programming style was just grottig and almost a textbook example of how to do it in the third millennium NOT should: fully functional programming with cryptic abbreviations for functions and variables - ouch.

Inheritance exhaust method and here - in this fourth edition of the programming style is a little better - the operation of the algorithm is much clearer through meaningful naming and code structuring, and partly meaningful classes are created, even if they are often in a static main () mentioned but nowhere is practiced. But well, here theoretical basics are taught and not programming style, but the latter met now at least the basic requirements that inexperienced programmers here at least a habit not completely wrong style.

Educationally, the book is but as usual absolutely succeeded. Sedgewick knows how to explain the algorithms to understand and simple, but with depth. For visually inclined people like me are especially the many excellent, sensible and clear visualizations, through which one quickly gets an intuitive feel for each operation - only for the "Sedgewick" It's worth the money. This does not mean that the book is not it rich in content or would seriously - the authors define the necessary concepts and give for most sentences evidence and proof sketches. While there are more formal books than this, but I find the mixture here is absolutely great and worthy of emulation. Unlike many other books on the subject, the authors have also repeatedly pointed to the practical relevance of the presented algorithms.

A small downer: In this version omitted the mathematical and geometric algorithms - as could have been used because of me the place of the long introduction about Java programming. Who but Java does not yet know who will be pleased with the solid and didactic turn successful introduction well. A new chapter comfort but a little about this omission away - here are some current practical applications of algorithms described (physical simulations, DNA sequencing, network flows) are presented vividly and interesting.

CONCLUSION: Those looking for a solid, clear and didactic successful introduction to the subject "Algorithms and Data Structures", the need not to look any further in my opinion. The third edition I really could not recommend, but this edition is a successful update of the classic, which fall is ideal especially for practitioners.