Hi, Possibly a dumb question, but I wonder if anyone can help me with this. What I want to do, essentially, is to loop over all ordered subsets of a given size of a certain set. Ultimately, the idea is to find the subset that maximises a certain value.
The set in question is likely large (the subset size is likely small, though), so things like combn don't seem to be a good solution. The biggest concern is keeping memory usage sane, but processing time is also fairly important. Any ideas? Zhou Fang ______________________________________________ R-help@r-project.org mailing list https://stat.ethz.ch/mailman/listinfo/r-help PLEASE do read the posting guide http://www.R-project.org/posting-guide.html and provide commented, minimal, self-contained, reproducible code.
