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))
|
2 | Pass |
z = 1:10;
zSorted_correct = 10:-1:1;
assert(isequal(complexSort(z),zSorted_correct))
|
851 Solvers
416 Solvers
Least common multiple of many numbers
159 Solvers
Number of 1s in a binary string
1231 Solvers
209 Solvers