Faster or smarter way to sort and intersect large amount of data??

2 次查看（过去 30 天）
want2know
want2know 2014-2-17
评论： Jos (10584) 2014-2-17
Dear Sir/Madam,
I was using "intersect" in my Matlab code to do the sorting where I want the following:
[ch] = sort(s, 'ascend');
[same, a] = intersect(s, ch);
For example:
input: s =[55 21 78 7]
output: ch = [7 21 55 78] a = [4 2 4 3]
I need to access ‘a’ where ‘a’ shows the original index prior to sorting so I can use it for further processing.
This method works exactly as what I want, but I guess it is taking a lot of time to do the sorting and intersect etc especially when the size of s approaching 100 or higher, are there other faster or smarter ways to do so?
Thank you very much.
  2 个评论
José-Luis
José-Luis 2014-2-17
What's a lot of time? Remember that the algorithmic complexity of sort is O(n log n) so there are limits to how fast you can make it, and Matlab is already pretty decent for this function.
want2know
want2know 2014-2-17
Thanks for your input, Jose-Luis... when "s" is approaching 100, it took 4 hours to run a "an-hour simulation"

请先登录，再进行评论。

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

采纳的回答

Jos (10584)
Jos (10584) 2014-2-17
intersect is pretty fast, so I would not worry too much ...
a = rand(100000,1) ;
b = rand(100000,1) ;
tic ; [c,i] = intersect(a,b) ; toc ;
% Elapsed time is 0.029850 seconds.
  4 个评论
显示 2更早的评论
want2know
want2know 2014-2-17
Thanks Jos, sorry I am new to Matlab, profiler? do you mean "profile on / profile viewer"? so that I can have a look about it

请先登录，再进行评论。

更多回答（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