算法基础

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 reading2 ELEMENTARY ALGORLTHMICS　2.1 Introduction　2.2 Problems and instances　2.3 The efficiency of algorithms　2.4 Average and worst-case analyses

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 reading2 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 reading3 ASYMPTOTIC NOTATION　……4 ANALYSISOF ALGORITHMS5 SOME DATA STRUCTURES6 GREEDY ALGORLTHMS7 DLVIDE-AND-CONQUER8 DYNAMIC PROGRAMMING9 EXPLORING GRAPHS10 PROBALILISTIC ALGORITHMS11 PARALLEL ALGORITHMS12 COMPUTATIONTL COMPLEXITY13 HEURISTIC AND APPROXIMATE ALGORITHMSREFERENCESINDEX

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