Problem 30. Sort a list of complex numbers based on far they are from the origin.

Solution 1748545

Submitted on 12 Mar 2019 by Zain Faruqi

This solution is locked. To view this solution, you need to provide a solution of the same size or smaller.

Test	Status	Code Input and Output
1	Pass	j = sqrt(-1); z = [-4 6 3+4j 1+j 0]; zSorted_correct = [6 3+4j -4 1+j 0]; assert(isequal(complexSort(z),zSorted_correct)) a = 0 1.4142 4.0000 5.0000 6.0000 i = 5 4 1 3 2 ans = 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)) a = 1 2 3 4 5 6 7 8 9 10 i = 1 2 3 4 5 6 7 8 9 10 ans = 10 9 8 7 6 5 4 3 2 1

Test

Status

Code Input and Output

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

a = 0 1.4142 4.0000 5.0000 6.0000 i = 5 4 1 3 2 ans = 6.0000 + 0.0000i 3.0000 + 4.0000i -4.0000 + 0.0000i 1.0000 + 1.0000i 0.0000 + 0.0000i

Pass

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

a = 1 2 3 4 5 6 7 8 9 10 i = 1 2 3 4 5 6 7 8 9 10 ans = 10 9 8 7 6 5 4 3 2 1