Cody

Problem 12. Fibonacci sequence

Solution 517859

Submitted on 29 Oct 2014 by Abhilash
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))

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

f1 = 1 f2 = 2 f1 = 2 f2 = 3 f1 = 3 f2 = 5 f1 = 5 f2 = 8

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

f1 = 1 f2 = 2 f1 = 2 f2 = 3 f1 = 3 f2 = 5 f1 = 5 f2 = 8 f1 = 8 f2 = 13 f1 = 13 f2 = 21 f1 = 21 f2 = 34 f1 = 34 f2 = 55

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

f1 = 1 f2 = 2 f1 = 2 f2 = 3 f1 = 3 f2 = 5 f1 = 5 f2 = 8 f1 = 8 f2 = 13 f1 = 13 f2 = 21 f1 = 21 f2 = 34 f1 = 34 f2 = 55 f1 = 55 f2 = 89 f1 = 89 f2 = 144 f1 = 144 f2 = 233 f1 = 233 f2 = 377 f1 = 377 f2 = 610 f1 = 610 f2 = 987 f1 = 987 f2 = 1597 f1 = 1597 f2 = 2584 f1 = 2584 f2 = 4181 f1 = 4181 f2 = 6765

Suggested Problems

More from this Author95

Community Treasure Hunt

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

Start Hunting!