Cody

# Problem 12. Fibonacci sequence

Solution 2004228

Submitted on 5 Nov 2019 by Nicholas Begg
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))

k = 0 k = 0 1 f = 1

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

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

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

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

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

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