1 / 4
Advanced Algorithm Design Techniques
80 likes | 397 Vues
Learn Greedy, Divide and Conquer, Dynamic Programming, Randomized, and Backtracking Algorithms. A comprehensive guide to mastering algorithmic strategies.
Télécharger la présentation
Advanced Algorithm Design Techniques
An Image/Link below is provided (as is) to download presentation
Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.
Content is provided to you AS IS for your information and personal use only.
Download presentation by click this link.
While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.
During download, if you can't get a presentation, the file might be deleted by the publisher.
E N D
Presentation Transcript
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.
More Related