Test | Status | Code Input and Output |
---|---|---|
1 | Pass |
j = sqrt(-1);
z = [-4 6 3+4*j 1+j 0];
zSorted_correct = [6 3+4*j -4 1+j 0];
assert(isequal(complexSort(z),zSorted_correct))
q =
2 3 1 4 5
ans =
6.0000 + 0.0000i 3.0000 + 4.0000i -4.0000 + 0.0000i 1.0000 + 1.0000i 0.0000 + 0.0000i
|
2 | Pass |
z = 1:10;
zSorted_correct = 10:-1:1;
assert(isequal(complexSort(z),zSorted_correct))
q =
10 9 8 7 6 5 4 3 2 1
ans =
10 9 8 7 6 5 4 3 2 1
|
8399 Solvers
498 Solvers
Rotate and display numbered tile
221 Solvers
395 Solvers
289 Solvers