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

Wow, I didn't think this would actually work.

Writing a solution whose size is so close to Leading solution is such a happy thing.

which leading solutions size is always 7 :S

I'm interested in the problem is, but due to the beginner, can't write a perfect solution.So if you can share your solution with me,I will be grateful to you！

Interesting. If you leave the 'ComparisonMethod','abs' it's still correct (size is 13).
Though, I believe this is the shortest, universally correct solution.

I keep receiving 'Matrix dimensions must agree' when using c(c==-d)... it seems to work fine in matlab, but not on here. Any ideas?

Note that "c(c==-d) = d" means that c and d must be same size or d is scalar. Moreover if d is not a scalar, then all "c==-d" must be true. This code seems to work in rare case, when one value is negative real number, and the rest are positive real numbers, but I have not tested it.

This is like the 'War & Peace' solution. I like it!

where is the problem here? it works on matlab

The function has to be named "complexSort".

Thanks for sharing

i have ran this solution in my MATLAB 2012Ra it's showing the desired result. then , why it is considerd incorrect here?

It looks like the function name has to have a capital S in it.

Simple and elegant, i like it

i keep learning new features...