Dear Pert,
Many thanks to your reply. Fully you are right!
Best wishes,
Helin.
--
View this message in context:
http://r.789695.n4.nabble.com/Comparison-of-the-amount-of-computation-tp3448436p3449722.html
Sent from the R help mailing list archive at Nabble.com.
___
On Thu, Apr 14, 2011 at 12:40:53AM -0700, helin_susam wrote:
> Hi Petr,
>
> Your idea looks like logically. So, can we say this with your idea; the
> expected number of computation in unique(sample(...)) is fewer than
> sample(...). Because, the expected length is 63.39677 in unique case, while
>
Hi Petr,
Your idea looks like logically. So, can we say this with your idea; the
expected number of computation in unique(sample(...)) is fewer than
sample(...). Because, the expected length is 63.39677 in unique case, while
the expected length is 100 in non-unique case ?
Thanks for reply,
Helin
On Wed, Apr 13, 2011 at 04:12:39PM -0700, helin_susam wrote:
> Hi dear list,
>
> I want to compare the amount of computation of two functions. For example,
> by using this algorithm;
>
> data <- rnorm(n=100, mean=10, sd=3)
>
> output1 <- list ()
> for(i in 1:100) {
> data1 <- sample(100, 100, re
Hi dear list,
I want to compare the amount of computation of two functions. For example,
by using this algorithm;
data <- rnorm(n=100, mean=10, sd=3)
output1 <- list ()
for(i in 1:100) {
data1 <- sample(100, 100, replace = TRUE)
statistic1 <- mean(data1)
output1 <- c(output1, list(statistic1))
}
5 matches
Mail list logo