15 of 16 people found the following review helpful
on 28 March 2003
Just about every Computer Science program requires a course called "Data Structures and Algorithms". In order to become a programmer you must understand the information provided in this course. This book was written as a textbook for a "Data Structures and Algorithms" course and all the expected topics are covered; arrays, queues, stacks, linked lists, trees, hash tables, heaps, sorting, recursion, and searching. Whether you are a teacher looking for a text, a student who wants a better text than the required one, or just someone who wants to learn more about programming, this book is a very good choice. By using Java, all the complications of C++ are eliminated and the author's crystal clear explanations come shining through. And the author's explanations and examples are excellent. For example, the chapter on link lists explains what a linked list is, what problems it is supposed to solve and what problems it fails to solve, and then shows how to implement your own link list. The author provides a set of applets to visually illustrate the topics covered in the book. There are questions at the end of each chapter and answers are provided. This book is not going to explain the Collection classes or help you learn the API. What this book will do is help you get a deeper understanding of what data structures are, how they work, and what performance sacrifices must be made in order to achieve better overall performance in your programs.
2 of 2 people found the following review helpful
on 3 December 2010
This book is not the prefect text where every category is explained as you would like it, but is any book. Data structures and algorithms require persistence of study from a number of sources. Lafore does a good job in explaining most of the subject contained and the diagrams help.
Other books on the subject are awful and dreary, I have read many of them and find my attention wandering very quickly. This isn't an easy subject, don't expect to read one book and get it, if it was easy everyone would be doing it.
1 of 1 people found the following review helpful
on 16 May 2010
I have purchased 5 different books on data structures and algorithms and this is amazing compared to any of the other books. The stuff is just so easy to understand. The author takes pain staking time to explain something but it is so worth while. Not covered in mathmitical details on how stuff works just simple exglish as it should be thought. I fail to understand why so many people teach this subject like a maths lecture. It is simply wrong and this book address that issue. Only downside is cd attached with example programs is using old out of date software. The author could revise book easly
on 22 May 2013
True, data structures can be hard to grasp. As a first-year student I experienced that to my bones. But, this book saved me. Suffice to say that I liked the book so much that I ordered it AFTER my final exam. I used the library version during the term but after the exam I thought to myself "It's not possible to let go of this book."
4 of 9 people found the following review helpful
on 15 February 2009
An ego trip of pretty applets, pretty pictures, and slow tedious explanations of which applet button to press (with their own headings and sections), which by the way, would be obvious to my 2 years old son.
The half of the book is code listings, (to be expected in a book about algorithms but in this case mostly fodder to fill space, not to put the idea across). Like:
add 20 more similar lines, repeat over every listing.
Some gems like:
"...but we haven't found the desired item, so we return total number elements in [array]....The user interprets this value to mean that the item wasn't found"
If you know absolutely nothing about programming, algorithms, data structures, Java, has lots of money and an inclination to waste some of it then buy this book.
I was going to drop it off in a charity shop but did not want to inflict it on someone else. Good as a doorstop only.