Cody

Solution 210615

Submitted on 28 Feb 2013 by Yaser
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))

zSorted = 1 absz = 4.0000 6.0000 5.0000 1.4142 0 x = 0 1 0 0 0 zSorted = 1 6 x = 0 1 0 0 zSorted = 1.0000 6.0000 3.0000 + 4.0000i x = 1 0 0 zSorted = 1.0000 6.0000 3.0000 + 4.0000i -4.0000 x = 1 0 zSorted = 1.0000 6.0000 3.0000 + 4.0000i -4.0000 1.0000 + 1.0000i x = 1 zSorted = Columns 1 through 5 1.0000 6.0000 3.0000 + 4.0000i -4.0000 1.0000 + 1.0000i Column 6 0 zSorted = 6.0000 3.0000 + 4.0000i -4.0000 1.0000 + 1.0000i 0

2   Pass
%% z = 1:10; zSorted_correct = 10:-1:1; assert(isequal(complexSort(z),zSorted_correct))

zSorted = 1 absz = 1 2 3 4 5 6 7 8 9 10 x = 0 0 0 0 0 0 0 0 0 1 zSorted = 1 10 x = 0 0 0 0 0 0 0 0 1 zSorted = 1 10 9 x = 0 0 0 0 0 0 0 1 zSorted = 1 10 9 8 x = 0 0 0 0 0 0 1 zSorted = 1 10 9 8 7 x = 0 0 0 0 0 1 zSorted = 1 10 9 8 7 6 x = 0 0 0 0 1 zSorted = 1 10 9 8 7 6 5 x = 0 0 0 1 zSorted = 1 10 9 8 7 6 5 4 x = 0 0 1 zSorted = 1 10 9 8 7 6 5 4 3 x = 0 1 zSorted = 1 10 9 8 7 6 5 4 3 2 x = 1 zSorted = 1 10 9 8 7 6 5 4 3 2 1 zSorted = 10 9 8 7 6 5 4 3 2 1