Data Structures and Algorithm Analysis in C (2nd Edition)

Description

In the second edition of this best-selling book, the author 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.

Key Features

• Includes a chapter on algorithm and design techniques that cover 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.
• Incorporates new results on the average case analysis of heapsort.
• Offers source code from example programme via anonymous FTP.

Table of Contents

1.  Introduction
2. Algorithms Analysis
3. Lists, Stacks, and Queues
4. Trees
5. Hashing
6. Priority Queues (Heaps)
7. Sorting
8. The Disjoint Set ADT
9. Graphs Algorithms
10. Algorithm Design Techniques
11. Amortized Analysis
12. Advanced Data Structures and Implementation

Author Biography

Mark Allen Weiss belongs to the Department of Computer Science at the Florida International University.