Data Structures and Problem Solving Using C++ - Mark Weiss

. .

Résumé :
Data Structures and Problem Solving Using C++ provides a practical introduction to data structures and algorithms from the viewpoint of abstract thinking and problem solving, as well as the use of C++. It is a complete revision of Weiss' successful CS2 book Algorithms, Data Structures, and Problem Solving with C++.The most unique aspect of this text is the clear separation of the interface and implementation. C++ allows the programmer to write the interface and implementation separately, to place them in separate files and compile separately, and to hide the implementation details. This book goes a step further: the interface and implementation are discussed in separate parts of the book. Part I (Objects and C++), Part II (Algorithms and Building Blocks), and Part III (Applications) lay the groundwork by discussing basic concepts and tools and providing some practical examples, but implementation of data structures is not shown until Part IV (Implementations). This separation of interface and implementation promotes abstract thinking. Class interfaces are written and used before the implementation is known, forcing the reader to think about the functionality and potential efficiency of the various data structures (e.g., hash tables are written well before the hash table is implemented).Throughout the book, Weiss has included the latest features of the C++ programming language, including a more prevalent use of the Standard Template Library (STL).

Sommaire:
I. OBJECTS AND C++. 1. Arrays, Pointers, and Structures. 2. Objects and Classes. 3. Templates. 4. Inheritance. 5. Design Patterns. II. ALGORITHMS AND BUILDING BLOCKS. 6. Algorithm Analysis. 7. The Standard Template Library. 8. Recursion. 9. Sorting Algorithms. 10. Randomization. III. APPLICATIONS. 11. Fun and Games. 12. Stacks and Compilers. 13. Utilities. 14. Simulation. 15. Graphs and Paths. IV. IMPLEMENTATIONS. 16. Stacks and Queues. 17. Linked Lists. 18. Trees. 19. Binary Search Trees. 20. Hash Tables. 21. A Priority Queue: The Binary Heap. V. ADVANCED DATA STRUCTURES. 22. Splay Trees. 23. Merging Priority Queues. 24. The Disjoint Set Class. Appendix A: Miscellaneous C++ Details Appendix B: Operators. Appendix C: Some Library Routines. Appendix D: Primitive Arrays in C++