How do I manipulate arrays more efficiently?

2 次查看（过去 30 天）
tr4nshum4n
tr4nshum4n 2016-5-5
回答： CS Researcher 2016-5-5
I am in the habit of using nested for loops to sort arrays. I suspect there are methods that are much simpler and don't require as much debugging.
The following is an example from a Cody problem. The function is to sort elements of vector a by their distance from number t. The name of the problem was "target sorting". Elements that are closest to t will be nearest the end of the vector. Elements that are farther from t will be nearest the beginning of the vector. Here is a link to the problem.
And here is my code:
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%% %%%% Code %%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%
function b = targetSort(a,t)
b = [];
for( i=1 : numel(a) )
shell = abs( t-a(i) )
if( numel(b) == 0)
b = [a(i)]
else
for( j=1: numel(b) )
if( shell > (abs(t - b(1))) )
b = [a(i) b]
break
end
k = j+1
if( j==numel(b) )
b = [b a(i)]
elseif( ...
and( ...
( shell <= abs(t - b(j )) ), ...
( shell >= abs(t - b(k)) ) ...
)...
)
b = [b(1:j) a(i) b(k:end ) ]
break
end
end
end
end
end
%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%%

请先登录，再回答此问题。

采纳的回答

CS Researcher
CS Researcher 2016-5-5
How about this:
b = abs(a-t);
[~,l] = sort(b,'descend');
c = a(l);
Hope this helps!

更多回答（0 个）

类别

在 Help Center 和 File Exchange 中查找有关 Shifting and Sorting Matrices 的更多信息

标签

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by