Cody

# Problem 12. Fibonacci sequence

Solution 1050428

Submitted on 10 Nov 2016 by ci
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))

f_array = 0 f_array = 0 1

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

f_array = 0 f_array = 0 1 f_array = 0 1 1 f_array = 0 1 1 2 f_array = 0 1 1 2 3 f_array = 0 1 1 2 3 5 f_array = 0 1 1 2 3 5 8 f = 8

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

f_array = 0 f_array = 0 1 f_array = 0 1 1 f_array = 0 1 1 2 f_array = 0 1 1 2 3 f_array = 0 1 1 2 3 5 f_array = 0 1 1 2 3 5 8 f_array = 0 1 1 2 3 5 8 13 f_array = 0 1 1 2 3 5 8 13 21 f_array = 0 1 1 2 3 5 8 13 21 34 f_array = 0 1 1 2 3 5 8 13 21 34 55 f = 55

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

f_array = 0 f_array = 0 1 f_array = 0 1 1 f_array = 0 1 1 2 f_array = 0 1 1 2 3 f_array = 0 1 1 2 3 5 f_array = 0 1 1 2 3 5 8 f_array = 0 1 1 2 3 5 8 13 f_array = 0 1 1 2 3 5 8 13 21 f_array = 0 1 1 2 3 5 8 13 21 34 f_array = 0 1 1 2 3 5 8 13 21 34 55 f_array = 0 1 1 2 3 5 8 13 21 34 55 89 f_array = 0 1 1 2 3 5 8 13 21 34 55 89 144 f_array = 0 1 1 2 3 5 8 13 21 34 55 89 144 233 f_array = 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 f_array = 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 f_array = Columns 1 through 16 0 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 Column 17 987 f_array = Columns 1 through 8 0 1 1 2 3 5 8 13 Columns 9 through 16 21 34 55 89 144 233 377 610 Columns 17 through 18 987 1597 f_array = Columns 1 through 8 0 1 1 2 3 5 8 13 Columns 9 through 16 21 34 55 89 144 233 377 610 Columns 17 through 19 987 1597 2584 f_array = Columns 1 through 8 0 1 1 2 3 5 8 13 Columns 9 through 16 21 34 55 89 144 233 377 610 Columns 17 through 20 987 1597 2584 4181 f_array = Columns 1 through 8 0 1 1 2 3 5 8 13 Columns 9 through 16 21 34 55 89 144 233 377 610 Columns 17 through 21 987 1597 2584 4181 6765 f = 6765