Professional Documents
Culture Documents
Pres
Pres
CSC 252
Algorithms
Haniya Aslam
Presentation Overview
Fibonacci:
function Fibonacci(n: integer) : integer;
var
i : index; sum, interm1, interm2: integer;
begin
interm1:= 0; {F0}
interm2:= 1; {F1}
for i:=3 to n do
sum :=interm1 + interm2;
interm1:=interm2;
interm2:= sum;
end {for}
Fibonacci := sum;
end {Fibonacci}
Dynamic Programming vs. Recursion
and Divide & Conquer
Given, for 1 I j n:
T[i,j] is the weight of an optimal triangulation of the polygon
http://www-cse/uta/edu/~holder/courses/cse5311/lectures/18/node18.html
http://www.middlebury.edu/~dickerso/ccsc/ugcg.html
http://www.eecs.harvard.edu/~nr/cs152/readings/dynamic.html
http://www.catalase.com/dprog.htm
http://mail.informs.org/classes/dynamic/node1.html
http://cse.hanyang.ac.kr/~jmchoi/c…6-2/algorithm/classnote/node6.html
http://people.bu.edu/rlynch/cs566/sld002.htm