Showing posts with label clrs. Show all posts
Showing posts with label clrs. Show all posts

Classic Data Structures in C++ Review

Classic Data Structures in C++
Average Reviews:

(More customer reviews)
Keep this book on your shelf for a long time, you'll look back to it often. The exmaples use STL (standard templete library) so you don't have to worry about the code being useless when it comes to your data struct. Lastly, don't be intimidated by this book; accessible to both the beginner and expert.

Click Here to see more reviews about: Classic Data Structures in C++



Buy Now

Click here for more information about Classic Data Structures in C++

Read More...

Practical Introduction to Data Structures and Algorithm Analysis (C++ Edition) (2nd Edition) Review

Practical Introduction to Data Structures and Algorithm Analysis (C++ Edition) (2nd Edition)
Average Reviews:

(More customer reviews)
I used this textbook to teach Data Structures and Algorithms at the sophomore-junior level to a class of 100 students. My primary focus is to teach the design and use of DS&A with a secondary focus on implementation in a specific language (Java in this case). From this point of view: Part I is excellent. Part II is above average. The discussion of trees is average with an implicitly narrow view of applications. Part III on sorting and searching is average with the exception of the horrible discussion of benchmarking in 8.8. The data are unqualified and misleading (compiled and interpreted run-times are compared as equals!). The discussion of hashing and B-Trees is poorly organized and narrow. Parts III and IV are oriented towards Java implementation. As such, there is no discussion of the limitations of actually using recursion in an implementation nor the efficient use of object-oriented structures in cache-based architectures. For a better discussion of DS&A, many of my less experienced students found relief in Robert Lafore's book (ISBN 1571690956) and the more advanced students consulted Weiss's text (ISBN 0201357542). For the following term I will try Cormen, Leiserson, and Rivest's classic Introduction to Algorithms (ISBN 0070131430) which uses pseudo-code and Lafore's book as a required supplement.

Click Here to see more reviews about: Practical Introduction to Data Structures and Algorithm Analysis (C++ Edition) (2nd Edition)

This practical text contains fairly "traditional"coverage of data structures with a clear and complete use of algorithm analysis, and some emphasis on file processing techniques as relevant to modern programmers. It fully integrates OO programming with these topics, as part of the detailed presentation of OO programming itself. Chapter topics include lists, stacks, and queues; binary and general trees; graphs; file processing and external sorting; searching; indexing; and limits to computation. For programmers who need a good reference on data structures.

Buy NowGet 40% OFF

Click here for more information about Practical Introduction to Data Structures and Algorithm Analysis (C++ Edition) (2nd Edition)

Read More...