Introduction to Computer Algorithms: Design and Analysis Techniques: Design and Analysis Techniques

Author: Liu Jing
Publisher:
Publish Date: 2003-09-01
Features: This book is a textbook for undergraduate students (upper-level) and graduate students in computer science, software engineering, network engineering, and related fields. Based on the new developments in computer technology at home and abroad, it introduces various design strategies for computer algorithms, including divide-and-conquer techniques, greedy techniques, dynamic programming techniques, backtracking and branch-and-bound techniques, etc. It also covers algorithm analysis techniques, including the analysis of time and space complexity of algorithms, such as worst-case and average-case analysis. The book discusses algorithms for various classic and applied problems, including sorting algorithms, searching algorithms, string matching algorithms, graph algorithms, scheduling algorithms, combinatorial optimization algorithms, and number theory algorithms. Additionally, it introduces new content such as approximation algorithms and probabilistic algorithms based on the theory of computational complexity.