Anonymous user
Talk:Power set: Difference between revisions
no edit summary
(The dumb answer?) |
No edit summary |
||
Line 1:
So how about the slow approach of coming up with random combinations and adding them to a set until it has 2<sup>n</sup> elements? The set object would have to guarantee uniqueness, but it would work eventually. To save some time you could add each element in the original list and the empty set to start then add sets of size 2 to n. --[[User:Mwn3d|Mwn3d]] 10:59, 16 June 2008 (MDT)
This is what your Ada code gives:
A
C
E
A
A,C
A,E
A,C
| |||