Data structures and problem solving using C++ /
Weiss, Allen Mark
Data structures and problem solving using C++ / Mark Allen Weiss. - 2nd ed. - Upper Saddle River : Addison-Wesley, c2002. - xvii, 890 p. : ill. ; 24 cm.
Table of Contents
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.
Includes bibliographical references and index.
9780321205001 0321205006
Computer programing
005.133 / WEI
Data structures and problem solving using C++ / Mark Allen Weiss. - 2nd ed. - Upper Saddle River : Addison-Wesley, c2002. - xvii, 890 p. : ill. ; 24 cm.
Table of Contents
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.
Includes bibliographical references and index.
9780321205001 0321205006
Computer programing
005.133 / WEI