Algorithms, data structures, and problem solving with C++

This book authored by Mark Allen Weiss, stands out as the first CS2 textbook to distinctly separate the interface and implementation of data structures. This innovative approach presents the interface and running time of data structures upfront, allowing students to apply these structures in various practical examples before delving into their implementations. This method significantly enhances students' ability to think abstractly.

Key Features:

• Emphasis on Data Structures and Algorithm Design: The book uses C++ as the implementation language while maintaining a strong focus on data structures and algorithm design.
• Abstraction Reinforcement: Interface and implementations of data structures are discussed separately, reinforcing abstract thinking.
• Incorporation of Case Studies: Practical examples, such as expression evaluation, cross-reference generation, and shortest path calculations, are used to illustrate concepts.
• Early Introduction to Time Complexity: A comprehensive discussion of time complexity and Big-Oh notation is provided early in the text.
• Instructor Flexibility: The book offers instructors flexibility in balancing practice, theory, and the level of C++ detail.
• Optional Advanced Material: Part V contains advanced material for those who wish to explore further.
• Coverage of Fundamental C++ Concepts: Classes, templates, and inheritance are covered as fundamental concepts in sophisticated C++ programs.
• Fully Functional and Tested Code: The book includes fully functional code tested on g++2.6.2, Sun 3.0.1, and Borland 4.5 compilers. This code is integrated into the book and also available via FTP.
• Supportive Learning Tools: End-of-chapter glossaries, summaries of common errors, and a variety of exercises help reinforce learning.

Weiss's textbook provides a comprehensive and structured approach to mastering algorithms, data structures, and problem-solving using C++, making it an invaluable resource for students and educators alike.