Rating: 
Summary: it's a horrible book in C programming
Review: It's a horrible book in C programming. I don't know why there are supporters for the book. The book is very confusing. I was getting lost "step by step" when i read the first few chapters. The book gives bad examples and inaccurate explainations. It will only lead you to become a bad programmer. In fact, some books like Robert Lafore's "C programming Using Turbo C++" contains the same programs (stacks, recursion, ...etc.) but with good examples and explainations. Honestly, keep away from this book.
Rating: 
Summary: a well-writen introductory book on data structures
Review: Personally ,as an introductory book on data structures , i found the book superb . First ,because its succeeds in giving incentives to study the subject-matter through interesting and concrete examples. And secondly attention has been put in making reading as easy as possible through drawings and coloring text. Lastly the author "promotes" nicely the concept of the "structure" in programs and shows it's importance throught the text.
Rating:
Summary: Bad, Bad, Bad book
Review: The author starts out by giving the reader one of the most confusing examples (The Game of Life) I have ever seen, then proceeds to base everything in the book on that one example.
It will give you a headache, I promise.
Try Data Structures Using C by Yedidyah Langsam. I had a copy that I got cheap as a backup and it saved my life.
Rating:
Summary: This book Sucks and Blows at the same time.
Review: The author wrote this to feel smarter than the reader. It should have been called "Stroking my Ego" by Robert Kruse. The concepts are lost in a sea of algorithms. The sample code in the book is divided up so much that you can't read it. There will be source code for one function of the program, then some text, then a couple of exercises, then some examples of bad code, then an example of better code, then more text, and then the next function. No where do you find complete source code for one sample. The first sample has less than 100 lines of code. It starts on page 7 and goes to page 24. In between there are 3 dummy functions and 6 exercises and countless lines of text. The code is bad too. In the first example in the book there are redefinitions that will cause errors in MSVC6.0. And the examples are far out there. You would think maybe start with an address book or something. The first example is a game that each cell has to access eight neighboring cells. To put it bluntly, I've read some good programming books, and this ain't one of them.
Rating:
Summary: Just a plain below average text of C++!
Review: The book does not flow well. The analysis are incomplete. The style is good. A much better book by far is by William Ford, Data Structures with C++ 1996 Prentice Hall. Ford does a super job with the logic of data structures. ISBN is 0024209716.
Rating:
Summary: A real good doorstop or paper weight.
Review: The logic behind the data structures presented is brief, and when you want understanding you have to use other texts, so it really does not live up to its purpose, of teaching data structures in C. The book is not well organized.
Rating:
Summary: best book on data structures available
Review: The previous Pascal edition of this book was extremely readable and what I learned data structures from. It had a lot of diagrams which were invaluable to understanding the algorithm. This book improves upon that edition by adding even more illustrative pictures and is updated with new algorithms and analysis techniques like amortized analysis which were not around when the old book was written. The writing style of the author is impeccably understandable. I collect books on algorithms and data structures and this is the most readable book ever.P.S. I've found the books which use STL to be opaque and focus more on STL and C++ than on understanding the data structure and algorithm. This is why many authors, including Sedgewick, eschew STL in their books. STL is also not relevant when programming in other languages, like the ubiquitous C programming language.
Rating:
Summary: best book on data structures available
Review: The previous Pascal edition of this book was extremely readable and what I learned data structures from. It had a lot of diagrams which were invaluable to understanding the algorithm. This book improves upon that edition by adding even more illustrative pictures and is updated with new algorithms and analysis techniques like amortized analysis which were not around when the old book was written. The writing style of the author is impeccably understandable. I collect books on algorithms and data structures and this is the most readable book ever. P.S. I've found the books which use STL to be opaque and focus more on STL and C++ than on understanding the data structure and algorithm. This is why many authors, including Sedgewick, eschew STL in their books. STL is also not relevant when programming in other languages, like the ubiquitous C programming language.
Rating:
Summary: Really not enough logical algorithm analysis.
Review: The text has a disappointing factor in it... it is vague on the logic behind data structures and you need to flip to and from different sections in the book its disorganized. The code examples don't compile smoothly-errors. The book is like his older C book, the same worthless style.
Rating:
Summary: One of the best book for introductory algorithms
Review: There is a number of books in Algorithm design which concentrate blindly on the run time complexity of algorithms, when covering them. This book is quite an exception to that tradition. In contrast, this book explain the algorithms itself. If you are interested to know about more detail and personalized characteristics of an algorithm, besides its running time complexity, such as space complexity, data movement complexity, performance on non asymptotic (smaller) case, etc. this is the book to read. Although, the book appears less technical at the first sight, I have compared it with Corman's. It contains almost all the analysis for the algorithms it presents. In fact Cormen's book lacks any analysis on space complexity. You will be disappointed in this book (like few other readers) if you are looking for a compendium of abstract complexity analysis of a large set of algorithms or just the discussion on data structure, pointer etc. It lacks advanced algorithms. Also, its graph theory chapter needs more depth. Without any reservation, I can say it is one of the best book available for first course in algorithm analysis and design.
|
