fortune candidate Your example requires all choices of 1541 out of 3000, which I would expect to take somewhere near age-of-the-universe seconds to compute. The code uses a clever nested compuation due to Gail et al which will cut that time down to infinity/10.
Sent from my iPhone > On Jun 4, 2016, at 07:28, Therneau, Terry M., Ph.D. <thern...@mayo.edu> wrote: > > Your example requires all choices of 1541 out of 3000, which I would expect > to take somewhere near age-of-the-universe seconds to compute. The code > uses a clever nested compuation due to Gail et al which will cut that time > down to infinity/10. ______________________________________________ R-help@r-project.org mailing list -- To UNSUBSCRIBE and more, see 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.
