Fundamentals of Data Structures in C [Paperback]

Ellis Horowitz (Author), Sartaj Sahni (Author), Susan Anderson-Freed (Author)

Book Description

Publication Date: August 2007 | ISBN-10: 0929306406 | ISBN-13: 978-0929306407 | Edition: 2

Designed to function as a textbook or as a professional reference, "Fundamentals of Data Structures in C" provides in-depth coverage of all aspects of data structure implementation in ANSI C. The book goes beyond the standard fare of stacks, queues, and lists to offer such features as afull chapter on search structures and a discussion of advanced tree structures. Recent data structure innovations rarelv found in other texts are presented, including Fibonacci Heaps, Splay Trees, Red-Black Trees, 2-3 Trees, 2-3-4 Trees, Leftist Trees, Binokcal Heaps, Min-Max Heaps, and Deaps.

--This text refers to an out of print or unavailable edition of this title.

Product Details

• Paperback: 617 pages
• Publisher: Silicon Pr; 2 edition (August 2007)
• Language: English
• ISBN-10: 0929306406
• ISBN-13: 978-0929306407
• Product Dimensions: 8.8 x 6 x 1.4 inches
• Shipping Weight: 1.8 pounds (View shipping rates and policies)
• Average Customer Review: 2.7 out of 5 stars  See all reviews (19 customer reviews)
• Amazon Best Sellers Rank: #839,483 in Books (See Top 100 in Books)

Customer Reviews

Most Helpful Customer Reviews

7 of 8 people found the following review helpful:

5.0 out of 5 stars A splendid formal treatment, December 26, 1999

By 

Sunil Kumar (Half Moon Bay, CA USA) - See all my reviews

This review is from: Fundamentals of Data Strucures in C (Hardcover)

This book treats the subject of algorithm analysis and data structure with great formalism. This book, in my view, is a must for any under grad course. This book lays foundation for a career in systems programming. However, if you only have passing interest in computer science, this is not a book for you.

[e-mail]

4 of 4 people found the following review helpful:

4.0 out of 5 stars Excellent Overall - Great content!, August 10, 2003

By 

Ted (United States) - See all my reviews
(REAL NAME)   

Amazon Verified Purchase

This review is from: Fundamentals of Data Structures in C++ (Hardcover)

This book has an amazing amount of content. Very few data structures books contain quite as many structures as this one; In addition to containing all the common data structures one usually studies, people can also study Splay Trees, Compressed Tries, Patricia, Fibonacci Heaps...really the list keeps going. The only things that it seems to be missing are skip lists and multidimensional range trees...

Most data structures have rigorous (college-level-worthy) proofs for complexity and performance. These proofs are typically required of a student in a graduate level course, and thus, this book could be used for a graduate-level text. Because of this however, some may find this book a little daunting, especially if you just need an introduction to the topic.

The C++ code samples use templates so that the data structures can be generalized and used for any type. Therefore, the C++ code is very reusable. However, the code can sometimes be a bit hard to understand, mostly due to short variable names, and poor in-code comments. This is one of the reasons I didn't give this book 5 stars. Overall though, this book stands out in the crowd.

3 of 3 people found the following review helpful:

1.0 out of 5 stars worst book for c++, July 15, 1998

By A Customer

This review is from: Fundamentals of Data Structures in C++ (Hardcover)

The most confusing book I ever read. I am a student at Cal Poly Pomona and I am studying CS. We are using this book for cs240 class. Ever body in the class agrees including the instructor that this book shouldn't be used for teaching. Our instructor is looking for a new book. The ideas and concepts are totally unclear. There are not enough examples. i really feel bad that I wasted my money on this book and now I have to buy another one