Description
Pearson Education Data Structures And Algorithm Analysis In C 2Nd Edition by Mark Allen Weiss
As a sequel to the bestseller by Mark Allen Weiss, his second edition has an increased focus on conceptual topics. His main emphases in the book are on ADTs and also on analyzing algorithms. The efficiency, the performance and the running time are the key areas of concentration in the book, as far as the analysis of algorithms is concerned. This edition comes inclusive of new chapters. The author has added a section on the design techniques of algorithm. In it he puts his focus on greedy dynamic programming, algorithms, conquer and divide algorithms, backtracking and randomized algorithms. As an up-to-date version of his already famous book, the author has incorporated not only the current topics, but also chapters that examine the new data structures. Skew heaps, skip lists, Fibonacci heaps, binomial queues, pairing heaps, k-d trees, splay trees are some of the many examples of recent topics and data structures that are integrated into the book. The book Data Structures and Algorithm Analysis in C also provides source code through the example programme. Chapters on contents such as amortized analysis, graph algorithms, stacks, lists and queues, sorting, hashing are a part of the book. In addition, the chapters on algorithm and design techniques and on advanced data structures and its implementation have been specifically strengthened in the book.