sorting according to another vector
198 次查看(过去 30 天)
显示 更早的评论
Hi,
I have a vector A that doesn't follow any order. I want to sort Matrix B that has the first column of values similar to those of A but in different order. Is it possible to sort B according to A using a single function or should I write many codes to do so?
0 个评论
采纳的回答
Walter Roberson
2011-8-5
Sorry you will have to use multiple calls:
[a_sorted, a_order] = sort(A);
newB = B(a_order,:);
1 个评论
Jan
2011-8-5
@Danielle: Ok, then I have misunderstood your question. The information that B has "value similar to those of A" is meaningless then - correct?
更多回答(4 个)
Jan
2011-8-5
I'm not sure, if I understand the question correctly. Do you want to bring B in the same order as the unsorted A? Then either sort both vectors and mix their sorting indicies:
[As, Ai] = sort(A);
[Bs, Bi] = sort(B(:, 1));
ABi(Ai) = Bi;
Now ABi is the sorting index to bring B to the order of A:
isequal(A, B(ABi, 1)) % ==> 1
Or let ISMEMBER do this for you:
[dummy, order] = ismember(A, B(:, 1));
isequal(A, B(order, 1)) % ==> 1
0 个评论
Pramit Biswas
2018-1-31
编辑:Pramit Biswas
2018-1-31
function B = sortBlikeA(A,B)
[~, Ao] = sort(A);
Bs=sort(B);
B(Ao)=Bs;
end
inzamam shoukat
2018-10-26
编辑:inzamam shoukat
2018-10-26
Hi every one......i have matrix lets suppose [3 2;1 9]
what i want to do is sort out the only first column in ascending order but problem is how to do it so that corresponding values which is in first row 2 for 3 in second row 9 for 1 change their positions according to the position of values of first column being sorted i.e [1 9; 3 2]...
LIMITATION : sorting operation never applied to second column....
2 个评论
Marco Bertola
2021-2-14
编辑:Marco Bertola
2021-2-14
I think the question (which I had too) was:
I have a reference vector [1.2 3.3 4.4] eg
and another ``similar'' vector [3.2 1.1 4.4]
Problem; find the optimal sorting of vector 2 so that it is ''closest'' (L^2 norm eg) to the reference vector.
Say X is your reference vector of size (1,n) and Xnew is the new vector of the same size
then what you want is accomplished like so:
dist = abs(ones(n,1)*X - Xnew.' ones(1,n));
[t1,J]= min(dist);
%now J has the optimal permutation%
Xnew=Xnew[J]
1 个评论
Walter Roberson
2022-2-10
If you are not permitted to duplicate any elements, and the entries are all finite then
[~, refidx] = sort(reference_vector);
sorted_similar = sort(similar_vector);
new_similar = sorted_similar(refidx);
另请参阅
类别
在 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!