Many thanks to Bill and Thomas for both insight and this nice solution.
Kathy Gerber
William Dunlap wrote:
If you diff the desired series you get all 2^n
possible n-long sequences of 0's and 1's. Hence
another solution is to convert the numbers in
0:(2^n-1) to their binary repre
1:length(dss)) {
a <- c(a,rep(comb[k, i], u[k, ptn]))
}
cat(sort(a-1,"\n")
}
}
}
I appreciate any insight or direction.
"Counting is hard." -- Alan Lee Schwartz
-
Kathy Gerber
University of Virginia
Research Compu
vel of
collaboration between Insightful and the R community.
Kathy Gerber
Spencer Graves wrote:
> Hi, Kathy, John, et al.:
> Has there been an answer to the question of why R has been much
> more successful than Octave?
> In this regard, can anyone provide a price comp
ntioned though was the idea of standards.
Finally, in comparing with Octave, it was mentioned that Octave may be
stuck in a position of playing catch-up to Matlab.
What I have here is far from complete, but I did want to give some
feedback tonight. Again, thanks to you
projects, say for example,
Octave don't enjoy that level of success?
I have some ideas of course, but I would really like to know your
thoughts when you look at R from such a vantage point.
Thanks.
Kathy Gerber
University of Virginia
ITC - Research Computing Support
_
5 matches
Mail list logo