Cody

# Problem 12. Fibonacci sequence

Solution 2061587

Submitted on 18 Dec 2019 by Andrew Ramsay
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))

A = 0

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

A = 0 0 0 0 0 0 A = 1 1 2 0 0 0 A = 1 1 2 3 0 0 A = 1 1 2 3 5 0 A = 1 1 2 3 5 8

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

A = 0 0 0 0 0 0 0 0 0 0 A = 1 1 2 0 0 0 0 0 0 0 A = 1 1 2 3 0 0 0 0 0 0 A = 1 1 2 3 5 0 0 0 0 0 A = 1 1 2 3 5 8 0 0 0 0 A = 1 1 2 3 5 8 13 0 0 0 A = 1 1 2 3 5 8 13 21 0 0 A = 1 1 2 3 5 8 13 21 34 0 A = 1 1 2 3 5 8 13 21 34 55

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

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