Cody

Problem 12. Fibonacci sequence

Solution 2015309

Submitted on 12 Nov 2019 by Laura D'Alessandro
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))

l = 1 1 2 0 0 0 l = 1 1 2 3 0 0 l = 1 1 2 3 5 0 l = 1 1 2 3 5 8
3   Pass
n = 10; f = 55; assert(isequal(fib(n),f))

l = 1 1 2 0 0 0 0 0 0 0 l = 1 1 2 3 0 0 0 0 0 0 l = 1 1 2 3 5 0 0 0 0 0 l = 1 1 2 3 5 8 0 0 0 0 l = 1 1 2 3 5 8 13 0 0 0 l = 1 1 2 3 5 8 13 21 0 0 l = 1 1 2 3 5 8 13 21 34 0 l = 1 1 2 3 5 8 13 21 34 55
4   Pass
n = 20; f = 6765; assert(isequal(fib(n),f))

l = 1 1 2 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 l = 1 1 2 3 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 l = 1 1 2 3 5 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 l = 1 1 2 3 5 8 0 0 0 0 0 0 0 0 0 0 0 0 0 0 l = 1 1 2 3 5 8 13 0 0 0 0 0 0 0 0 0 0 0 0 0 l = 1 1 2 3 5 8 13 21 0 0 0 0 0 0 0 0 0 0 0 0 l = 1 1 2 3 5 8 13 21 34 0 0 0 0 0 0 0 0 0 0 0 l = 1 1 2 3 5 8 13 21 34 55 0 0 0 0 0 0 0 0 0 0 l = 1 1 2 3 5 8 13 21 34 55 89 0 0 0 0 0 0 0 0 0 l = 1 1 2 3 5 8 13 21 34 55 89 144 0 0 0 0 0 0 0 0 l = 1 1 2 3 5 8 13 21 34 55 89 144 233 0 0 0 0 0 0 0 l = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 0 0 0 0 0 0 l = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 0 0 0 0 0 l = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 0 0 0 0 l = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 0 0 0 l = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 0 0 l = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 0 l = 1 1 2 3 5 8 13 21 34 55 89 144 233 377 610 987 1597 2584 4181 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!