Cody

# Problem 12. Fibonacci sequence

Solution 160031

Submitted on 9 Nov 2012 by Bruce
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

### 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))

fa = 1 1 2 1 1 1 fa = 1 1 2 3 1 1 fa = 1 1 2 3 5 1 fa = 1 1 2 3 5 8

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

fa = 1 1 2 1 1 1 1 1 1 1 fa = 1 1 2 3 1 1 1 1 1 1 fa = 1 1 2 3 5 1 1 1 1 1 fa = 1 1 2 3 5 8 1 1 1 1 fa = 1 1 2 3 5 8 13 1 1 1 fa = 1 1 2 3 5 8 13 21 1 1 fa = 1 1 2 3 5 8 13 21 34 1 fa = 1 1 2 3 5 8 13 21 34 55

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

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