Why is rand faster than rand(1) ?

2 次查看(过去 30 天)
I am optimizing my monte-carlo codes and have a question on rand function. Below, i give simple codes to get a random number. All three of the below works for my problem. Looking at the elapsed times, I want to know why is rand faster than rand(1)? Although I kind of know why method 3 is fast, your comments are most welcome.
%%%%%%%%%%%%%%
% METHOD - 1
tic
for count = 1:1e7
a = rand;
end
toc
% Elapsed time is 0.383401 seconds.
%%%%%%%%%%%%%%
% METHOD - 2
tic
for count = 1:1e7
a = rand(1);
end
toc
% Elapsed time is 7.589860 seconds.
%%%%%%%%%%%%%%
% METHOD - 3
a = rand(1e7,1);
tic
for count = 1:numel(a)
aa = a(count);
end
toc
% Elapsed time is 0.139859 seconds.
%%%%%%%%%%%%%%
  5 个评论
John D'Errico
John D'Errico 2020-7-21
With no inputs at all, the need for input checks would seem to be lessened.

请先登录,再进行评论。

回答(0 个)

类别

Help CenterFile Exchange 中查找有关 Logical 的更多信息

标签

产品


版本

R2016a

Community Treasure Hunt

Find the treasures in MATLAB Central and discover how the community can help you!

Start Hunting!

Translated by