本书是关于算法导论的经典教材，书中包括大量例题解答与命题证明。本书是按照算法类型而不是按照应用类型对算法进行介绍，以其清晰的概念讲解赢得专家们的广泛赞誉。
本书适用对象广泛。对于学习算法设计与分析的本科生和研究生，本书是优选教材。对于从事算法计算研究和工程应用的科研人员和工程技术人员，本书也是一本**的基础性读物。

1 PRELIMINARIES
1.1 Introductiom
1.2 What is an algorithm?
1.3 Notatiom for programs
1.4 Mathematical notation
1.5 Proof technique1-Contradiction
1.6 Proof technique2-Mathematical induction
1.7 Some reminders
1.8 Problems
1.9 References and further reading
2 ELEMENTARY ALGORLTHMICS
2.1 Introduction
2.2 Problems and instances
2.3 The efficiency of algorithms
2.4 Average and worst-case analyses
2.5 What is an elementary operation?
2.6 Why look for efficiency?
2.7 Some examples
2.8 When is an algorithm specified?
2.9 Problems
2.10 References and further reading
3 ASYMPTOTIC NOTATION
……
4 ANALYSISOF ALGORITHMS
5 SOME DATA STRUCTURES
6 GREEDY ALGORLTHMS
7 DLVIDE-AND-CONQUER
8 DYNAMIC PROGRAMMING
9 EXPLORING GRAPHS
10 PROBALILISTIC ALGORITHMS
11 PARALLEL ALGORITHMS
12 COMPUTATIONTL COMPLEXITY
13 HEURISTIC AND APPROXIMATE ALGORITHMS
REFERENCES
INDEX