Algorithms and data structures : design, correctness, analysis
Author(s)
Bibliographic Information
Algorithms and data structures : design, correctness, analysis
（International computer science series）
Addison-Wesley, c1998
2nd ed
Available at / 10 libraries
-
No Libraries matched.
- Remove all filters.
Note
Bibliographical references: p. 367-371
Includes index
Description and Table of Contents
Description
Algorithms and data structures lie at the heart of computer science, and are essential tools for every practising programmer. This book provides an in-depth treatment of the central algorithms and data structures of computer science, together with an introduction to the techniques of design, correctness and analysis required for understanding them. Beginning with coverage of techniques followed by the major application areas of lists, trees, symbol tables, priority queues, sorting, disjoint sets, and graph algorithms. The theory is then completed with a closing chapter on lower bounds.
Table of Contents
Preface.
1. Algorithm Correctness.
2. Analysis of Algorithms.
3. Data Abstraction.
4. Algorithm Design.
5. Lists, Stacks, and Queues.
6. Trees.
7. Symbol Tables.
8. Priority Queues.
9. Sorting.
10. Disjoint Sets.
11. Graphs.
12. Five Classic Graph Problems.
13. Lower Bounds.
Appendix A. Reading Eiffel.
Appendix B. Recommended Reading.
by "Nielsen BookData"
