Subj : Re: Unique sets from {1..n} ?
To   : comp.programming
From : TC
Date : Sat Jul 09 2005 10:08 pm

Hi Willem

I am aware of the pattern! It was just the algorithym that defeated me.
And I had not thought of using the bit pattern to select the items. I'm
currently using that approach:

for k = 1 to n
   for j=1 to 32(or whatever)
       if bit j=1, add item #j to set #k

But I will look at the other suggested approaches as well.

Thanks all,
TC

.