We finally get into recursion to generate Fibonacci
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))
|
Project Euler: Problem 2, Sum of even Fibonacci
462 Solvers
451 Solvers
Getting the row and column location from a matrix
192 Solvers
394 Solvers
357 Solvers