Cody

Problem 12. Fibonacci sequence

Solution 293240

Submitted on 31 Jul 2013 by Ace
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.
Solve This Problem View on Solution Map

Test Suite

Test Status Code Input and Output
1   Pass
%% n = 1; f = 1; assert(isequal(fib(n),f))

sum = 0 1

2   Pass
%% n = 6; f = 8; assert(isequal(fib(n),f))

sum = 0 1

3   Pass
%% n = 10; f = 55; assert(isequal(fib(n),f))

sum = 0 1

4   Pass
%% n = 20; f = 6765; assert(isequal(fib(n),f))

sum = 0 1

Suggested Problems

More from this Author95