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))
|
5363 Solvers
559 Solvers
Project Euler: Problem 6, Natural numbers, squares and sums.
782 Solvers
Flag largest magnitude swings as they occur
524 Solvers
403 Solvers