why setdiff have time longer than for ?
显示 更早的评论
*hi,
Itried to make my code be faster , so i used setdiff instead of a part in my code
I used:*
v=(1:18);
buf=setdiff(v,unique_x);
relevant_item(ttt(i),1:length(buf))=buf;
*instead of *
for v=1:18
b2=find(unique_x==v);
if isempty(b2)
relevant_item(ttt(i),h)=v;
h=h+1;
end
end
*why the running time of this part is less than of setdiff?
thanks*
采纳的回答
Walter Roberson
2013-5-12
setdiff() essentially has to sort each time -- or at least to check if the set is ordered.
Are the unique_x restricted to being in the allowed range for v, 1:18 ? If so, then how about
buf = 1:10;
buf(unique_x) = [];
relevant_item(ttt(i),1:length(buf))=buf;
3 个评论
huda nawaf
2013-5-12
huda nawaf
2013-5-15
Jan
2013-5-15
@huda: Look into the code of setdiff. You find the relevant part in the fast MEX function ismembc2, which expects pre-sorted data. So sort your data explicitly, call this function and use the replied indices. Note that ismembc2 is not documented, but you find enough information about it in the net.
更多回答（0 个）
类别
在 帮助中心 和 File Exchange 中查找有关 Shifting and Sorting Matrices 的更多信息
2013-5-12
Community Treasure Hunt
Find the treasures in MATLAB Central and discover how the community can help you!
Start Hunting!
Translated by 
