Solution 2035340

Submitted on 26 Nov 2019

Size: -1
Leading solution size is 7.

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

2 Comments

2 Comments

tkd on 26 Nov 2019

I broke Cody server with this.

function f = fib(n)
a=[0 1];
indx=n-1;
if n==0
f=a(1);
elseif n==1
f=a(2);
else
while indx <= n
a(indx+1)=fib(n-1)+fib(n-2);
indx=indx+1;
end
f=a(n);

end

also my size is -1 shouldnt I win?

Riemanns world on 7 Dec 2020

When you want to calculate fib(1), it calls fib(0) + fib(-1). There is no fib(-1) so you never leave the while loop.

Test Suite

Info

While evaluating the solution, the server encountered an error caused by long running MATLAB code. Edit the code if needed and then submit.

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Problem 12. Fibonacci sequence

Test Suite

Info

Suggested Problems

More from this Author95

Community Treasure Hunt

Problem 12. Fibonacci sequence

Test Suite

Info

Suggested Problems

More from this Author95

Community Treasure Hunt

Players