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].
quite easy
I bet
a nice practice.
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 I pass the second sample??
I don't why this easy problem come at last.
Good one.
well.........simulator is not working.better to think about it
This is well above the average size. I must be missing something that would make this much simpler.
consider using the 'sort' function !!
I find [b,I]=sort(A) is really a useful method!
What?? Strange method to get lowest size.
Should dynamic regular expressions be disabled ? This could be done on about thing !!
Brilliant use of complex numbers to force sort(x) to operate on abs(x)
sortrowsc? Strange I can run this function in R2012b, but I cannot find it in help.
It is a MEX file function called by sortrows. Check it out in the sortrows source code.
You do not need to use the real function
12866 Solvers
1407 Solvers
Sum of first n terms of a harmonic progression
156 Solvers
513 Solvers
240 Solvers