Professional Documents
Culture Documents
Introduction
Sk Mazharul Islam
• Fibonacci Sequence
f 0 0, f1 1, f n f n1 f n2
– Algorithm 1 (Recursion)
function fib (n : integer) : integer;
begin
if n ≤ 1 then fib=n
else fib = fib(n-1) + fib(n-2);
end;
– Divide-and-conquer approach
• Binary Search : no overlap
• Fibonacci sequence : full of overlapping
ƒ(5)
ƒ(3) ƒ(4)