Introduction to Algorithms -- A Creative Approach

Author: (USA) Udi Manber (Manber, U.) Author, Translated by Huang Lipeng et al.
Publisher:
Publish Date: 2005-09-01
Features: This book is a renowned work written by the international algorithm master Dr. Udi Manber, emphasizing the creative aspects of algorithm design. It describes the process of algorithm design through the steps of algorithm development. Additionally, the book creatively compares the algorithm design process with the process of theorem induction proof, revealing the fundamental ideas and essence of algorithm design, aiming to enhance readers' problem-solving skills and their ability to understand the process and principles of algorithm design.
Features of the Book: Includes classic algorithms as well as popular algorithms; techniques of algorithm design and their comprehensive applications; parallel algorithm design; pseudocode representation for most algorithms; over 500 exercises, with a quarter of them provided with answers; separating algorithm implementation details from algorithmic ideas as much as possible.
This book is a renowned work written by the international algorithm master Dr. Udi Manber. The book is divided into 12 chapters: Chapters 1 to 4 are introductory content, covering topics such as mathematical induction, algorithm analysis, and data structures; Chapter 5 proposes the idea of algorithm design by analogy with theorem induction proof; Chapters 6 to 9 present algorithms in four fields, such as algorithms for sequences and sets, graph algorithms, geometric algorithms, and algebraic and numerical algorithms; Chapter 10 discusses reductions, which also serves as a prelude to Chapter 11, which covers NP-complete problems; Chapter 12 introduces parallel algorithms; followed by answers to some exercises and references.
The book has two key features, aimed at improving readers' problem-solving skills and enabling them to understand the process and principles of algorithm design: First, it emphasizes the creative process of algorithm design, focusing on the creative ideas behind algorithm design rather than getting bogged down in detailed discussions of specific algorithms; Second, it compares algorithm design with theorem induction proof, revealing the fundamental ideas and essence of algorithm design.
The organization of the book is clear and easy to understand, emphasizing creativity and having a distinctive style. To this day, it still holds great value and is suitable as a textbook for algorithm and advanced algorithm courses in computer science and related fields.