Yes, I was just thinking that, too... as you can use the rows with m 1s as the combination rows in mCn Interesting how many things you can do with #:i.2^ n, it's not the first time I've used it, either.
I was wondering - since the said essay warns of space and time exponential growth - does this mean it's better to use explicit loops in such cases? On 20 August 2011 21:47, Roger Hui <[email protected]> wrote: > The rows of #:i.2^n contains the information needed > to generate m comb n . The combinations essay > has this tidbit. > > ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
