Cody

Problem 12. Fibonacci sequence

Solution 2012533

Submitted on 10 Nov 2019 by saeedeh ostovari
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))

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

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

F = 1 0 0 0 0 0 0 0 0 0 F = 1 1 0 0 0 0 0 0 0 0 f = 55
4   Pass
n = 20; f = 6765; assert(isequal(fib(n),f))

F = 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 F = 1 1 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 f = 6765

Suggested Problems

More from this Author95