Data Structures and Algorithms (Addison-Wesley Series in Computer Science and Information Pr)

Data Structures and Algorithms (Addison-Wesley Series in Computer Science and Information Pr)
Customer Review: Let's not get too excited

Hyperbolic remarks about this book will mislead you into thinking that this book is absolutely unique, when it's not. The material here is standard and present on many, many algorithms and data structures book.



Furthermore, this book is dated, as it uses Pascal. It has very little relevance for today's world of collections of data structures made by experts (on Java, C#, Eiffel, Smalltlak, etc.) which are resources you need to know how to tap into to be more productive.



And as a last point, algorithm analysis is not the strong point of this book either, as it is just a late chapeter in the book and gets nowhere near advanced (i.e., real) algorithmic analysis (for which you will need higher math, such as calculus and probability).



Nevertheless, it's a good book but I don't know if you should buy it instead of that other, nice and new book using Java 5.0 using generics.

Customer Review: An okay book!

It is just an okay book, not extraordinary in any way. Especially, this is certainly not for the novice in this topic, i.e., it is certainly not a good introductory book. So if you are new to data structures and algorithms, stay away from this book, go for some good introductory book.



For the advanced readers, it is an okay book. Better books are available, e.g., books by Cormen et al. and Robert Sedgewick.



The book is written in a way not very intersting or engaging. The algorithms are not explained in detail. Often things are left unexplained or assumed that the reader already knows it. Algorithms are presented in pseudocode, which causes problems especially for the readers familiar to some particular programming language.