You're viewing a comment by alpha and its responses.
You're viewing a comment by alpha and its responses.
I am being sponsored by Syntress! They bought me an amazing dedicated server to run catonmat on. If you're looking web services, I highly recommend the Syntress guys!
I love to read science books. They make my day and I get ideas for awesome blog posts, such as Busy Beaver, On Functors, Recursive Regular Expressions and many others.
Take a look at my
Amazon wish list, if you're curious about what I have planned reading next, and want to surprise me. :)
If you are interested in advertising on catonmat.net, contact me.
Free tools for coding on Vietstarsoft.com.
Programming homework help.


I mostly remember it being unpleasant, and hoped I’d find something more modern and elegant here :-)
Easiest way to do is to observe that for a set of size N, each element in the power set corresponds to a binary vector of length N. For example, for a set of size 3 with elements {A,B,C}
000 --> {}
001 --> {A}
010 --> {B}
...
111 --> {A,B,C}
So to enumerate the elements of a power set, just iterate over the 2^N possible values of a binary vector of length N.
Reply To This Comment