Data Structures and Problem Solving with C++ (2nd Edition)

Author: (USA) Wiess M.A. (Author), translated by Zhang Liping
Publisher:
Publish Date: 2005-08-01
Features: This book introduces data structures and algorithms from the perspectives of abstract thinking, problem-solving, and the use of the C programming language. It includes the new features of C and can fully utilize the Standard Template Library (STL) everywhere. C allows programmers to separate interfaces and implementations, storing them in individually compiled files while hiding the specific details of the implementation. This book goes a step further: the interfaces and implementations of data structures are discussed in different parts of the book. Part I (Objects and C), Part II (Algorithms and Building Blocks), and Part III (Applications) lay the foundation, focusing on various basic concepts and providing practical examples. Part IV (Implementation) introduces the implementation of data structures. This separation of interface and implementation promotes abstract thinking. Writing and using class interfaces before their implementations forces readers to consider the functionality and potential of various data structures (e.g., using a priority queue before its implementation). Features: Includes the new developments in C, with a new chapter on models, and uses the vector class throughout. The revised material appropriately incorporates the use of STL. While introducing important details of advanced C usage, it also covers new content on classes and inheritance (which simplify the initial representation). It elaborates on the STL interfaces of data structures, providing STL implementations, as well as simplified interfaces without STL, making it easier to understand the fundamental knowledge of data structures without the complexity of STL. It includes a large amount of code. All of this has been thoroughly rewritten and tested to be compatible with various compilers currently available.