Items related to Data Structures and Algorithm Analysis in C
Synopsis
About the Book: Data Structures and Algorithm Analysis inC In this second edition of his best-selling book, Data Structures and Algorithm Analysis in C, Mark AllenWeiss, continues to refine and enhance his innovative approachto algorithms and data structures. Using a C implementation, hehighlights conceptual topics, focusing on ADTs and the analysis ofalgorithms for efficiency as well as performance and running time.Dr.Weiss also distinguishes Data Structures and Algorithm Analysisin C with the extensive use of figures and examples showing thesuccessing stages of an algorithm, his engaging writing style, anda logical organization of topics. 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. Contains a chapter on amortized analysis that examines the advanced 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 tress, pairing heaps, and more. Incorporates new results on the average case analysis of heap sort. Contents Preface Introduction Algorithms Analysis Lists, Stacks, and Queues Trees Hashing Priority Queues (Heaps) Sorting The Disjoint Set ADT Graphs Algorithms Algorithm Design Techniques Amortized Analysis Advanced Data Structures and Implementation Index Solved Question Papers
"synopsis" may belong to another edition of this title.
(No Available Copies)
Search Books: Create a WantCan't find the book you're looking for? We'll keep searching for you. If one of our booksellers adds it to AbeBooks, we'll let you know!
Create a Want