Data Structures and Program Design in C

by Clovis L. Tondo and Robert L. Kruse

Book Overview

This introduction to data structures using the C programming language demonstrates the stepwise refinement of ideas into runable programs, emphasizing problem specification and program correctness. Suitable as a text for a one- or two-semester course, the prerequisite being a first course in program

• Format: Hardcover
• Language: English
• ISBN: 0137256493
• ISBN13: 9780137256495
• Release Date: January 1991
• Publisher: Prentice Hall
• Length: 525 Pages
• Weight: 0.65 lbs.
• Dimensions: 1.1" x 7.8" x 9.5"

Customer Reviews

AWESOMENESS!

The item that I bought was EXCELLENT. It's like brand new and the shipping was super duper fast! Thank you so much for your business.

Excellent book.

This is a great book! I don't know why other reviewers are so aggravated with it, but I find it to be one of the clearest and ideally arranged books on data structures that are out there. It is also useful to mention that the great illustrations relaxed my eyes and worked a great deal on strengthening the point, making sure I understood the concept behind the algorithm.

best book on data structures available

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.

One of the best book for introductory algorithms

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.

a well-writen introductory book on data structures

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.