包邮算法基础

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