- #1
Nano-Passion
- 1,291
- 0
This is what my book gives for recursion of fibonacci sequence (matlab coding).
function res = fib(n)
if n == 1;
res = 0;
elseif n == 2
res = 1;
else
res = fib(n-1) + fib(n-2);
end
Am I mistaken or this doesn't work for fib(3)? Keep in mind I am still learning about recursion.
>> fib(3)
res = fib(2)+fib(1)
fib(1) = 0. fib(2) = 1
therefore fib (3) = 1+0 = 1
fib(3) should be 2.
function res = fib(n)
if n == 1;
res = 0;
elseif n == 2
res = 1;
else
res = fib(n-1) + fib(n-2);
end
Am I mistaken or this doesn't work for fib(3)? Keep in mind I am still learning about recursion.
>> fib(3)
res = fib(2)+fib(1)
fib(1) = 0. fib(2) = 1
therefore fib (3) = 1+0 = 1
fib(3) should be 2.