Preface. 1. Introduction. 2. Algorithm Analysis. 3. Asymptotic Notation. 4. Foundational Data Structures. 5. Data Types and Abstraction. 6. Stacks, Queues and Deques. 7. Ordered Lists and Sorted Lists. 8. Hashing, Hash Tables and Scatter Tables. 9. Trees. 10. Search Trees. 11. Heaps and Priority Queues. 12. Sets, Multisets and Partitions. 13. Garbage Collection. 14. Algorithmic Patterns and Problem Solvers. 15. Sorting Algorithms and Sorters. 16. Graphs and Graph Algorithms. A. Java and Object-Oriented Programming. B. Class Hierarchy Diagrams. C. Character Codes. Index.
Copyright 2000 by John Wiley & Sons.
Full text. BibTeX entry.