DynamicProgramming.pptVIP

動態規劃 Dynamic Programming 演算法方式總覽 The Divide-and-Conquer Strategy (個各擊破) binary Searching、Quick Sort…. The Greedy Method(貪婪演算法) Prim MST、Kruskal MST、Djikstras algorithm Dynamic Programming(動態演算法) 二項是係數、矩陣連乘、最佳二元搜尋樹… Trace Back(回溯) 圖形著色、漢米爾迴路問題…. Tree Searching Strategy(樹的追蹤) 費氏數列(Fibonacci sequence) Fibonacci sequence: 0 , 1 , 1 , 2 , 3 , 5 , 8 , 13 , 21 , … Fi = i if i ? 1 Fi = Fi-1 + Fi-2 if i ? 2 Solved by a recursive program: Much replicated computation is done. It should be solved by a simple loop. Dynamic Programming Dynamic Programming is an algor