Data Structures and Algorithms in C++

by David Mount, Roberto Tamassia, Michael T. Goodrich, et al.

Book Overview

* Provides a comprehensive introduction to data structures and algorithms, including their design, analysis, and implementation * Each data structure is presented using ADTs and their respective implementations * Helps provide an understanding of the wide spectrum of skills ranging from sound algorithm and data structure design to efficient implementation and coding of these designs in C++ Wiley Higher Education

• Format: Paperback
• Language: English
• ISBN: 0471202088
• ISBN13: 9780471202080
• Release Date: February 2003
• Publisher: Wiley
• Length: 704 Pages
• Weight: 2.87 lbs.
• Dimensions: 1.2" x 7.6" x 9.7"

Customer Reviews

****An Advanced book on Data Structures using C++ ********************

I used this book to supplement to my coursebook that was required for my Data Structure class. Pros: I used this book more than my coursebook. There are a lot of advanced topics for you to study. The book starts with a very good introduction to C++ Language and moves on explaining objects, classes , inheritance and polymorphism in one chapter which is really good. chapter 3 on Analysis book is very well written and clearly explain Big -O very clearly , in fact it has one of the best explanation compared to any other Data Structure book in the market. The rest of the book is well organized with all important Data Structures. This book has excellent explanation and has deep explanation on various subject which you will not find in any other Data Structure book. cons: The codes are not easy to read and understand if you have no experience in Data Structures. I found many examples in the book very complicated. The codes are not explained in a step by step fashion. clearly not the best book for beginners in DS. Overall i highly recommend this book for students who enjoy programming and want to learn more than what is discussed in the class. Also it is a great book to increase your knowledge on Data Structures.