"Authorized adaptation from the United States edition, entitled Data structures and Algorithm Analysis in C++, Fourth Edition, ISBN 9780132847377, by Mark Allen Weiss, published by Pearson Education ©2014"--Title page verso.

Includes index.

Chapter 1: Programming: A General Overview -- Chapter 2: Algorithm Analysis -- Chapter 3: Lists, Stacks, and Queues -- Chapter 4: Trees -- Chapter 5: Hashing -- Chapter 6: Priority Queues (Heaps) -- Chapter 7: Sorting -- Chapter 8: The Disjoint Sets Class -- Chapter 9: Graph Algorithms -- Chapter 10: Algorithm Design Techniques -- Chapter 11: Amortized Analysis -- Chapter 12: Advanced Data Structures and Implementation -- Appendix A: Separate Compilation of Class Templates.

This is an advanced algorithms book that bridges the gap between traditional CS2 and Algorithms Analysis courses. As the speed and power of computers increases, so does the need for effective programming and algorithm analysis. By approaching these skills in tandem, Mark Allen Weiss teaches readers to develop well-constructed, maximally efficient programs using the C++ programming language. This book explains topics from binary heaps to sorting to NP-completeness, and dedicates a full chapter to amortized analysis and advanced data structures and their implementation. Figures and examples illustrating successive stages of algorithms contribute to Weiss careful, rigorous and in-depth analysis of each type of algorithm.