in reply to Sets of subsets
Any suggestions of a better/different way to do a grouping of this nature are of course completely appreciated.I probably completely misunderstand what you are going to do, but it looks like a naive simple algorithm is O(n2k), where n is the number of sets, and k the number of thingies in a set. But the number of subsets is already Θ(2n). Going this way doesn't seem like an efficient solution to me.
|
---|
Replies are listed 'Best First'. | |
---|---|
Re^2: Sets of subsets
by jpearl (Scribe) on Jul 22, 2009 at 20:44 UTC | |
by JavaFan (Canon) on Jul 22, 2009 at 21:16 UTC | |
by jpearl (Scribe) on Jul 22, 2009 at 22:00 UTC |
In Section
Seekers of Perl Wisdom