Algorithm Design and Analysis -- C++ Language Description

Author: Chen Huinan
Publisher:
Publish Date: 2006-05-01
Features: This book is well-structured, comprehensive in content, rigorous in logic, and easy to understand. The algorithms provided include complete C programs with ingenious design and detailed comments. All programs have been compiled and run correctly in the VC environment. They serve as excellent examples for learning algorithm design and make complex and abstract algorithms more accessible and understandable for learners. The book contains numerous examples and illustrations, along with abundant exercises, making it convenient for self-study. It can be used as a textbook or reference for undergraduate and graduate students in computer science and technology and related fields in universities. It is also a valuable teaching reference for courses like "Algorithm Design and Analysis" or "Data Structures," as well as for computer professionals and others who wish to learn about and understand algorithms.
The content of the book is divided into three parts: Algorithms and Algorithm Analysis, Algorithm Design Strategies, and Solving Difficult Problems. The first part introduces problem-solving methods, algorithm complexity and analysis, recursive algorithms, and recurrence relations. The second part discusses common algorithm design strategies: basic search and traversal methods, divide-and-conquer, greedy algorithms, dynamic programming, backtracking, and branch-and-bound. The third part covers NP-complete problems, randomized algorithms, approximation algorithms, and cryptographic algorithms.
Additionally, the book introduces two new data structures: skip lists and splay trees, along with their specific algorithmic analysis methods. It also provides a brief discussion on modern cryptography.