Mark Allen Weiss' successful book provides a modern approach to algorithms and data structures using the C programming language. The book's conceptual presentation focuses on ADTs and the analysis of algorithms for efficiency, with a particular concentration on performance and running time. This edition contains a new chapter that examines advanced data structures such as red black trees, top down splay trees, treaps, k-d trees, and pairing heaps among others. All code examples now conform to ANSI C and coverage of the formal proofs underpinning several key data structures has been strengthened.
Table of Contents:
(All chapters, except Chapter 3, conclude with a Summary, Exercises and References.)
1. Introduction.
2. Algorithm Analysis.
3. Lists, Stacks, and Queues.
4. Trees.
5. Hashing.
6. Priority Queues (Heaps).
7. Sorting.
8. The Disjoint Set ADT.
9. Graph Algorithms.
10. Algorithm Design Techniques.
11. Amortized Analysis.
12. Advanced Data Structures and Implementation.