I didn't even think about going the recursive route. Seems obvious now.
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))
|
3 | Pass |
%%
n = 10;
f = 55;
assert(isequal(fib(n),f))
|
4 | Pass |
%%
n = 20;
f = 6765;
assert(isequal(fib(n),f))
|
Find the sum of the elements in the "second" diagonal
994 Solvers
Basic electricity in a dry situation
488 Solvers
Make an awesome ramp for a tiny motorcycle stuntman
334 Solvers
Flip the vector from right to left
2667 Solvers
Is this is a Tic Tac Toe X Win?
438 Solvers
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!