A function that returns a sequence of subsets generated by the power set of a specified set. The function use bit patterns to generate sets. for example the power set generated by a set with 3 elements set [1;2;3;] has 2^3 sets. each set in the power set is represented by the set bits in each of the integer from 0 to (2^3) -1
8 people like thisPosted: 10 years ago by isaiah perumalla
Simple implementation of the Sieve of Eratosthenes with set arithmetic.
3 people like thisPosted: 3 years ago by galacticdessert