How do I create a faster ordered vector without for loop

Oluwaseun Lijoka

2015 11 25

1 个回答

回答已采纳

22 次查看（30 天）

显示更早的评论

0 个投票

I discover that this pseudo code within my code makes my program slow probably because of the for loop and the fact that JJ is not pre-allocated. I will appreciate a faster idea.

JJ=[];
for j=0:p
  JJ=[JJ; repmat(j,[1+((j+1)-1)*2,1])];
end

0 个评论
显示 -2更早的评论隐藏 -2更早的评论

请先登录，再进行评论。

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

请先登录再关注

采纳的回答

Stephen23 2015-11-25

编辑：Stephen23 2015-11-25

在 MATLAB Online 中打开

0 个投票

X = floor(sqrt(0:(p+1)^2-1))';

This is nearly fifty times faster (p=1000):

Elapsed time is 5.2233 seconds.
Elapsed time is 0.111006 seconds.

As p gets larger it will reach your memory limit very quickly: each magnitude increase in p causes a two-magnitude increase in the number of elements of the output vector.