Here is the listing of Best reference books on Algorithms – I.
|1. “Introduction to Algorithms” by T. H. Cormen, C. L. Leiserson, R. L. Rivest, and C. Stein
Book Review: This book contains a number of algorithms and provides in-depth analysis and design of those algorithms which is well understood by readers at all levels. In addition, the algorithms also contain pseudo code which is easily understood by the readers. There are chapters which cover new topics like linear programming, randomized algorithms, probabilistic analysis and multithreaded algorithms. Improvised algorithms on Dynamic Programming and Greedy Techniques are also included in the book. The book also contains special algorithms on string matching, computational geometry and number theory.
|2. “Algorithm Design” by J. Kleinberg and E. Tardos
Book Review: This book contains several methods which identify the problems across a range of computing applications, develops algorithm design techniques for those problems and identifies efficient solutions to those problems. The book establishes a relationship between the algorithmic ideas and formulated problems for which algorithmic design and analysis takes place. The book also offers insight on identifying the problems in complex situations from different computing areas thereby designing efficient algorithms for those problems.
|3. “Data Structures and Their Algorithms” by Harry R. Lewis and Larry Denenberg|
|4. “Algorithmic Graph Theory” by A. Gibbons
Book Review: The book contains the concepts of pure and applied graph theory that include spanning trees, network flow, connectivity, traversals and matching. It also covers a range of classical algorithms thereby focusing on algorithms and their complexity. The algorithms are categorized based on the ones which are intractable and the ones which have known efficient solutions. Efficient approximation algorithms are being given for intractable problems. Programming languages like Pascal are used to describe algorithmic problems.
|5. “Algorithm Design: Foundations, Analysis and Internet Examples” by Michael T. Goodrich and Roberto Tamassia
Book Review: The book deals with the design and analysis of algorithms and data structures. The various topics included in the book are algorithmic design patterns and frameworks, graph and combinatorial algorithms, numerical algorithms, internet algorithms and geometric algorithms. The book also provides practical and theoretical techniques as well as experimental methods for the engineering of algorithms.
Sanfoundry Global Education & Learning Series – Best Reference Books!