Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
x = [2 6 -3
7 12 0
-12 5 1];
y_correct = [12 7 1
6 2 0
5 -3 -12];
assert(isequal(doubleSort(x),y_correct))
|
2 | Pass |
x = randi(10,5,8);
assert(isequal(size(doubleSort(x)),size(x)))
|
3 | Pass |
x=magic(6);
y_correct = ...
[ 36 35 34 27 26 25
33 32 31 24 23 22
30 29 28 21 20 19
18 17 16 9 8 7
15 14 13 6 5 4
12 11 10 3 2 1];
assert(isequal(doubleSort(x),y_correct))
|
Return the 3n+1 sequence for n
5205 Solvers
1514 Solvers
112 Solvers
96 Solvers
115 Solvers