Cody

Solution 2099739

Submitted on 20 Jan 2020 by Amiko2011
This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test Suite

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))

absZ = 4.0000 6.0000 5.0000 1.4142 0 z1 = 0 0 0 0 0 0 0 0 0 0 z1 = 4.0000 0 6.0000 0 5.0000 0 1.4142 0 0 0 z1 = 4.0000 + 0.0000i -4.0000 + 0.0000i 6.0000 + 0.0000i 6.0000 + 0.0000i 5.0000 + 0.0000i 3.0000 - 4.0000i 1.4142 + 0.0000i 1.0000 - 1.0000i 0.0000 + 0.0000i 0.0000 + 0.0000i z2 = 6.0000 + 0.0000i 6.0000 + 0.0000i 5.0000 + 0.0000i 3.0000 - 4.0000i 4.0000 + 0.0000i -4.0000 + 0.0000i 1.4142 + 0.0000i 1.0000 - 1.0000i 0.0000 + 0.0000i 0.0000 + 0.0000i zSorted = 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))

absZ = 1 2 3 4 5 6 7 8 9 10 z1 = 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 0 z1 = 1 0 2 0 3 0 4 0 5 0 6 0 7 0 8 0 9 0 10 0 z1 = 1 1 2 2 3 3 4 4 5 5 6 6 7 7 8 8 9 9 10 10 z2 = 10 10 9 9 8 8 7 7 6 6 5 5 4 4 3 3 2 2 1 1 zSorted = 10 9 8 7 6 5 4 3 2 1