Talk:Power set: Difference between revisions

Content added Content deleted

Inline

Revision as of 22:56, 1 April 2009

So how about the slow approach of coming up with random combinations and adding them to a set until it has 2ⁿ 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. --Mwn3d 10:59, 16 June 2008 (MDT)

This is what your Ada code gives:

A
C
E
A
A,C
A,E
A,C

This is fixed. --Dmitry-kazakov 18:22, 14 October 2008 (UTC)

Another copyleft issue?

About Smalltalk code... as written, is taken from a (odd?) blog hosted on the GNU Smalltalk site... so I suppose the content conforms to free doc license or GPL... check the link. I really believe there's no problem in publishing on RC; I will try to contact the author. If any problem, I'll remove it. --ShinTakezou 22:56, 1 April 2009 (UTC)

@@ Line 11: / Line 11: @@
 : This is fixed. --[[User:Dmitry-kazakov|Dmitry-kazakov]] 18:22, 14 October 2008 (UTC)
+== Another copyleft issue? ==
+About Smalltalk code... as written, is taken from a (odd?) blog hosted on the GNU Smalltalk site... so I suppose the content conforms to free doc license or GPL... check the link. I really believe there's no problem in publishing on RC; I will try to contact the author. If any problem, I'll remove it. --[[User:ShinTakezou|ShinTakezou]] 22:56, 1 April 2009 (UTC)