Sorting duplicate incremental array elements
显示 更早的评论
I was curious if there is a more efficient method for performing the following result:
>> x = 1:4;
>> xx = sort(x([1:end,1:end]))
1 1 2 2 3 3 4 4
If an alternative method is applicable to the previous example, consider also the more general case:
>> x = 1:4;
>> n = 2;
>> xn = sort(x(repmat([1:end],[1,n])))
To me it seems like the use of the sort command is inefficient and could cause notable performance reductions when working with larger incremental lists.
I would appreciate any suggestions.
回答（1 个）
x = 1:4; %sort(x); %if needed
xx = [x;x];
xx = xx(:);
类别
在 帮助中心 和 File Exchange 中查找有关 Shifting and Sorting Matrices 的更多信息
产品
2014-7-9
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
