Budd, Timothy.

Classic data structures in C++ / Timothy A. Budd. - Reading, Mass. : Addison-Wesley Pub. Co., c1994. - xviii, 543 p. : ill. ; 25 cm.

Includes bibliographical references (p. 533-537) and index.

I. Terms, Tools, and Technology
1. Engineering Software
2. Creating Software Components
3. Algorithms
Descriptions of Behavior
II. Analysis, Algorithms, and Abstractions
4. Strings
An Example ADT
5. Classification of Collections
6. Vectors and Component Reuse
7. Inheritance
Power Through Polymorphism
8. Lists
A Dynamic Data Structure
9. Stacks and Queues
Higher-Level Abstractions
10. Trees
A Nonlinear Data Structure
11. Searching
12. Priority Queues
13. Hash Tables
14. Sets and Bags
Unordered Collections
15. Dictionaries and Tables
16. Graphs
17. Files
External Collections
Appendix A Catalogue of Data Structures
Appendix B If C++ Is the Solution, Then What Is the Problem?
Appendix C Timing Data for Sorting Algorithms
Appendix D Table of Various Functions

0201508893 TZs.117950/-


C++ (Computer program language)
Data structures (Computer science)

005.7 BUD