Sort the given list of numbers a according to how far away each element is from the target value t. The result should return the list sorted in descending order of the absolute value of the difference between a(n) and t.
So if a = [1 2 4 8 17] and t = 12, then the output b should be [1 2 4 17 8].
Solution Stats
Problem Comments
Show
2 older comments
YUANYU YANG
on 27 Mar 2015
a nice practice.
naixin mu
on 20 May 2018
function b = targetSort(a,t)
[m,n]=sort(abs(a-t),'descend');
k=a(n);
for i=1:length(a)
if k(i)>=t
b(i)=m(i)+t;
else if k(i)<t
b(i)=t-m(i);
end
end
end
round(b)
end
why can't I pass the second sample??
Akash Srivastav
on 24 May 2018
I don't why this easy problem come at last.
Solution Comments
-
3 Comments
tr4nshum4n
on 5 May 2016
This is well above the average size. I must be missing something that would make this much simpler.
steph26
on 13 Jul 2016
consider using the 'sort' function !!
dymaxwell
on 21 Aug 2018
I find [b,I]=sort(A) is really a useful method!
1 player likes this solution
-
2 Comments
Daniel Pereira
on 15 Apr 2013
What?? Strange method to get lowest size.
G K
on 15 Apr 2013
Should dynamic regular expressions be disabled ? This could be done on about thing !!
3 players like this solution
-
1 Comment
Brian Moore
on 30 Mar 2015
Brilliant use of complex numbers to force sort(x) to operate on abs(x)
2 players like this solution
-
2 Comments
Lone Christoffersen
on 25 Sep 2012
sortrowsc? Strange I can run this function in R2012b, but I cannot find it in help.
Óscar
on 27 Sep 2012
It is a MEX file function called by sortrows. Check it out in the sortrows source code.
Recent Solvers2581
Tags
Discover what MATLAB® can do for your career.
Opportunities for recent engineering grads.
Apply Today
21 players like this problem
21 players like this problem