Algorithm Design and Analysis

Author: Wang Hongmei
Publisher:
Publish Date: 2006-07-01
Features: Algorithm design and analysis is a core professional basic course in computer science and technology, which is gaining increasing importance. This book effectively combines classic computer problems with algorithm design techniques, systematically introducing algorithm design techniques and their applications in classic problems. The book consists of 12 chapters. Chapter 1 introduces the basic concepts of algorithms and algorithm analysis methods. Chapter 2 introduces the NP-completeness theory from the perspective of algorithms. Chapters 3 to 11 respectively introduce algorithm design techniques such as brute-force method, divide-and-conquer method, reduction method, dynamic programming method, greedy method, backtracking method, branch-and-bound method, probabilistic algorithms, and approximation algorithms. Chapter 12 introduces the theory of computational complexity based on the Turing machine computational model. Each chapter includes a reading material written in an easy-to-understand style, introducing some of the latest research achievements in the field of algorithms. All algorithms in the book are provided with pseudocode, and most of them are also described in C++. All problems in the book are accompanied by several application examples. The book is rich in content, easy to understand, combined with practical applications, and illustrated with abundant figures. It can serve as a teaching material for undergraduate and graduate students in computer science at universities and colleges, and can also be used as a reference for engineering technicians and self-study readers.