Sort elements of Array by given condition

4 次查看（过去 30 天）
Daniel
Daniel 2022-12-28
编辑： Matt J 2022-12-28
Hello,
i have a vector n 480x1 and would like to sort the vector so that the condition
sum(([n ;0]-[0 ;n])>0)==68
is given. How could i do this? my approach was to realize a permutation of the vector until the condition is given. Unfortnely, this takes too much time.
Thanks in advance
  5 个评论
显示 3更早的评论
Torsten
Torsten 2022-12-28
编辑：Torsten 2022-12-28
For that there are 68 pairs such that
n(i+1) - n(i) > 0, n(0) = 0 (i=0,...,67)
your array must have at least 68 different elements.
Yours has only 27.

请先登录，再进行评论。

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

采纳的回答

Matt J
Matt J 2022-12-28
编辑：Matt J 2022-12-28
Ran in:
n=load('vector').xr;
m=numel(n);
n=n(randperm(m));
loc=find(([n ;0]-[0 ;n])>0);
n(loc(68):end)=sort(n(loc(68):end),'descend');
sum(([n ;0]-[0 ;n])>0)
ans = 68

更多回答（1 个）

Sulaymon Eshkabilov
Sulaymon Eshkabilov 2022-12-28
Ran in:
load('vector.mat')
XR1 = [xr;0]; XR2 = [0;xr];
IND = (XR1-XR2)>0;
ii = 1;
S = 0;
while S~=68
S(ii+1) = S(ii)+IND(ii);
ii=ii+1;
end
fprintf('Summation is halted at %d step and the sum is %d \n', ii, S(ii))
Summation is halted at 226 step and the sum is 68

类别

在 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