> On 23 Aug 2017, at 23:12 , Bert Gunter <bgunter.4...@gmail.com> wrote: > >> This points to a different algorithm where you write 0:(2^n-1) as n-digit >> binary numbers and chose items corresponding to the 1s. That won't give the >> combinations **sorted by size of selected subgroup** though. Something like >> this: > > No it doesn't. > -- Bert
Doesn't what? Do what I say it won't?? -pd -- Peter Dalgaard, Professor, Center for Statistics, Copenhagen Business School Solbjerg Plads 3, 2000 Frederiksberg, Denmark Phone: (+45)38153501 Office: A 4.23 Email: pd....@cbs.dk Priv: pda...@gmail.com ______________________________________________ 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.
