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))
ind =
2 3 1 4 5
|
2 | Pass |
%%
z = 1:10;
zSorted_correct = 10:-1:1;
assert(isequal(complexSort(z),zSorted_correct))
ind =
10 9 8 7 6 5 4 3 2 1
|
5704 Solvers
1047 Solvers
Replace multiples of 5 with NaN
282 Solvers
1394 Solvers
1078 Solvers