80 likes | 315 Views
Learn Greedy, Divide and Conquer, Dynamic Programming, Randomized, and Backtracking Algorithms. A comprehensive guide to mastering algorithmic strategies.
E N D
Algorithm Design Techniques http://net.pku.edu.cn/~course/cs202/2014 Hongfei Yan School of EECS, Peking University 2/8/2014
Outline • Greedy Algorithm (贪心算法) • Divide and Conquer(分治) • Dynamic Programming (动态规划) • Randomized Algorithms (随机算法) • Backtracking Algorithms (回溯法)
References • Chapter 10 @ Data Structures and Algorithm Analysis in C++ (4th Edition),by Mark A. Weiss, Prentice Hall, June 11, 2013.