Data Structures & Algorithm Analysis in C++

Author: Mark Allen Weiss
Publisher:
Publish Date: 2002-09-01
Features: This book is a condensed version of the author's "Algorithm, Data Structures, and Problem Solving with C++" published in 1996. The original book has 807 pages, and the author has rearranged the content, including algorithms. This book has 575 pages and is divided into 12 chapters, with the content in the following order: Introduction to C++; Algorithm Analysis; Lists, Stacks, and Queues; Trees; Hashing; Priority Queues (Heaps); Sorting; Disjoint Sets; Graphs; Algorithm Design Techniques; Buffer Analysis; Advanced Data Structures and Implementations. The appendix provides templates for class design. The content of this book is basically in line with the current syllabus requirements for "Data Structures and Algorithms" and is relatively suitable for current teaching needs. The arrangement of content is reasonably logical, concise, and clearly explained, making it suitable for use by senior undergraduate and graduate students.