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

Solution 2008845

Submitted on 8 Nov 2019 by Chul Min Yeum

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)) I = 2 3 1 4 5
2	Pass	z = 1:10; zSorted_correct = 10:-1:1; assert(isequal(complexSort(z),zSorted_correct)) I = 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))

I = 2 3 1 4 5

Pass

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

I = 10 9 8 7 6 5 4 3 2 1