Course6动态规划DynamicProgramming.pptVIP

Algorithms (Dr. Shi-Jay Chen, National United University) Course 6動態規劃Dynamic Programming ▓ Outlines 本章重點 Divide-and-Conquer v.s. Dynamic Programming Dynamic Programming v.s. Greedy Approach Floyds Algorithm for Shortest Paths Chained Matrix Multiplication Dynamic Programming and Optimization Problems ▓ Divide-and-Conquer v.s. Dynamic Programming 由前一單元得知，Divided-and-Conquer即為遞迴解法。 以費氏數 (Fibonacci Number) 說明: Recursive Fibonacci Algorithm inputs: num identified the ordinal of the Fibonacci number outputs: returns the nth Fibonacci number void Fib(int n) { if (n is 0 OR n is 1)