|
Is there an algorithm for exhaustively generating all unordered subsets of a particular set? Basically, if you imagine a set of 6 elements, each of which can be an integer 0-9, then there are 5005 unique, unordered sets (eg. { 0 0 0 0 0 1 } and { 1 0 0 0 0 0 } are identical). I'd like to generate all 5005 of these, without wasting any time generating duplicates (obviously, I could walk through generating all 1,000,000 ordered sets -- but then I'd just feel silly!). Is anyone aware of an algorithm which does this?
|
#
¿
Mar 8, 2008 07:16
|
|
|
|
| # ¿ May 4, 2024 07:47 |
|