Algorithm Design and Analysis

Author: Zheng Zonghan
Publisher:
Publish Date: 2005-06-01
Features: "Design and Analysis of Algorithms" features appropriate content selection, logical arrangement, a gradual and progressive approach, seamless connectivity, and step-by-step development. It can serve as a textbook for undergraduate and graduate students in computer science at universities, as well as a reference for scientific and technical personnel in computer science and applications. The book systematically introduces the concepts and methods of algorithm design and analysis, divided into four parts. Part 1 includes the first two chapters, introducing the fundamental concepts of algorithm design and analysis and the necessary mathematical tools, with a detailed explanation of the concept of algorithmic time complexity and algorithmic analysis methods. Part 2 includes Chapters 3 to 9, focusing on algorithm design techniques, starting with sorting problems and operations on discrete sets, then covering recursion, divide-and-conquer, greedy algorithms, dynamic programming, backtracking, branch and bound, and random algorithms, along with their complexities. Part 3 includes Chapters 10 and 11, discussing algorithms in computer application fields, such as problems in graphs and networks, as well as computational geometry problems. Part 4 includes Chapters 12 to 15, covering theoretical issues in algorithm design and analysis, such as NP-completeness, computational complexity, lower bound theory, and concludes with an introduction to approximation algorithms and their performance analysis. The book features appropriate content selection, logical arrangement, a gradual and progressive approach, seamless connectivity, and step-by-step development. It can serve as a textbook for undergraduate and graduate students in computer science at universities, as well as a reference for scientific and technical personnel in computer science and applications.