In this second edition of his best-selling book, Data structures and Algorithm Analysis in C, Mark Allen Weiss, continues to refine and enhance his innovative approach to algorithms and data structures. Using a C implementation, he highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. Dr. Weiss also distinguishes Data Structures and Algorithm Analysis in C with the extensive use of figures and examples showing the successive stages of an algorithm, his engsging writing style, and a logical organization of topics.
Features
- Includes a chapter on algorithm and design techniques that covers greedy algorithms, divide and conquer algorithms, dynamic programming, randomized algorithms, and backtracking.
- Presents current topics and newer data structures such as Fibonacci heaps, skew heaps, binomial queues,skip lists,and splay trees.
- Contains a chapter on amortized analysis that examines the advances data structures presented earlier in the book.
- Provides a new chapter on advanced data structures and their implementation covering red black trees, top down splay trees, treaps, k-d trees, pairing heaps, and more.
- Incorporates new results on the average case analysis of heapsort.
- Offers source code from example programs via anonymous FTP.
1. Introduction
2. Algorithm Analysis
3. Lists, Stacks, and Queues
4. Trees
5. Hashing
6. Priority Queues (Heaps)
7. Sorting
8. The Diajoint Set ADT
9. Graph Algorithms
10. Algorithm Design Techniques
etc.