Algorithm Design and Analysis - Computer Science and Technology

Author: Lü Guoying
Publisher:
Publish Date: 2006-03-01
Features: This book follows the knowledge system of the "China Computing Curricula 2002" and introduces the fundamental knowledge of algorithms and their design and analysis. Through numerous examples, it explains enumeration methods, recursive methods, divide-and-conquer methods, greedy algorithms, dynamic programming, and algorithm strategies related to graph search. Additionally, it covers the use of basic tools in algorithm design and techniques in algorithm design, which are essential foundations. Finally, practical examples are provided for algorithm design. Algorithms are described using a C-like language, discarding unique C language symbols and employing symbols close to natural language (English), making it highly readable and suitable for readers with different programming language backgrounds.
This book follows the knowledge system of the "China Computing Curricula 2002" (abbreviated as "CCC2002") and introduces the fundamental knowledge of algorithms and their design and analysis. Through numerous examples, it explains enumeration methods, recursive methods, divide-and-conquer methods, greedy algorithms, dynamic programming, and algorithm strategies related to graph search. Additionally, it covers the use of basic tools in algorithm design and techniques in algorithm design, which are essential foundations. Finally, practical examples are provided for algorithm design. Algorithms are described using a C-like language, discarding unique C language symbols and employing symbols close to natural language (English), making it highly readable and suitable for readers with different programming language backgrounds.
This book can serve as a textbook for senior undergraduate and graduate students in computer science and related fields, as well as a reference for computer professionals,, and information science enthusiasts.