Data structure and algorithm analysis in C
Mark Allen Weiss
Data structure and algorithm analysis in C - 2nd ed, - Noida Pearson 1997 - 527p. 23cm,
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
Using a C implementation, this book highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. It presents data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees. It offers source code from example programs via anonymous FTP
9788177583588
data structures
004.422 / WEI
Data structure and algorithm analysis in C - 2nd ed, - Noida Pearson 1997 - 527p. 23cm,
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
Using a C implementation, this book highlights conceptual topics, focusing on ADTs and the analysis of algorithms for efficiency as well as performance and running time. It presents data structures such as Fibonacci heaps, skew heaps, binomial queues, skip lists, and splay trees. It offers source code from example programs via anonymous FTP
9788177583588
data structures
004.422 / WEI