This is way more efficient than the recursive algorithms.
How?
Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
%%
n = 1;
c_correct = 1;
assert(isequal(collatz(n),c_correct))
|
2 | Pass |
%%
n = 2;
c_correct = [2 1];
assert(isequal(collatz(n),c_correct))
|
3 | Pass |
%%
n = 5;
c_correct = [5 16 8 4 2 1];
assert(isequal(collatz(n),c_correct))
|
4 | Pass |
%%
n = 22;
c_correct = [22 11 34 17 52 26 13 40 20 10 5 16 8 4 2 1];
assert(isequal(collatz(n),c_correct))
|
Find relatively common elements in matrix rows
645 Solvers
522 Solvers
Replace NaNs with the number that appears to its left in the row.
1711 Solvers
1594 Solvers
324 Solvers