# Generating Power Set

Iterating over all possible subsets of a set is a problem that can arise not only in competitive programming but also in day-to-day programming. While the total number of possible subsets is quite huge (2^n where n is the cardinality of the input set), often we want an algorithm that systematically considers all subsets for small values of n.

A power set is a set of all subsets of a given input set. Often we may want to simply iterate over all members of the power set, but sometimes (if we have enough memory) we may need the power set itself. In the following post, I have attempted to present some algorithms (with C++11 implementations) that solve both kinds of problems (simple iteration and complete power set construction).

## Recursive algorithm for power set generation

Power set generation is a problem that yields naturally to a recursive algorithm. Consider a set say, $$\lbrace 1, 2, 3, 4 \rbrace$$. If we had a function that can generate the power set, $$\mathbb{S}$$, of $$\lbrace 2, 3, 4 \rbrace$$ we can generate the power set of the original input set by appending 1 to each member of $$\mathbb{S}$$ (call the result $$\mathbb{T}$$) and then taking the union of $$\mathbb{S}$$ and $$\mathbb{T}$$.

As an example, let us try generating the powerset of $$\lbrace 1, 2, 3 \rbrace$$. The power set of $$\lbrace 2, 3 \rbrace, \mathbb{S},$$ is $$\lbrace \phi, \lbrace 2 \rbrace , \lbrace 3 \rbrace , \lbrace 2, 3 \rbrace \rbrace$$. Adding $$1$$ to each member of $$\mathbb{S}$$, gives us, $$\mathbb{T}$$, $$\lbrace \lbrace 1 \rbrace, \lbrace 1, 2 \rbrace, \lbrace 1, 3 \rbrace, \lbrace 1, 2, 3 \rbrace \rbrace$$. Union of $$\mathbb{S}$$ and $$\mathbb{T}$$ gives us the required answer: $$\lbrace \phi, \lbrace 2 \rbrace , \lbrace 3 \rbrace , \lbrace 2, 3 \rbrace, \lbrace 1 \rbrace, \lbrace 1, 2 \rbrace, \lbrace 1, 3 \rbrace, \lbrace 1, 2, 3 \rbrace \rbrace$$.

Translating the above idea to code (C++11):

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22  // Accepts a set of integers and optionally a position to start reading the // array from. // Returns the powerset of integers from arr [pos=0 ... arr.size()-1] vector< vector > powerset1(const vector &arr, int pos=0) { int arr_size = arr.size(); vector< vector > results; if (pos >= arr_size) { // Recursion base case results.push_back(vector()); return results; } vector< vector > rest = powerset1(arr, pos+1); results = rest; for (auto &subset : rest) { subset.push_back(arr[pos]); results.push_back(subset); } return results; } 

I have assumed a set of integers that do not have duplicates. The code can be easily modified to accept other datatypes or maybe templates. If the vector has duplicate elements, just copy and deduplicate it before passing.

Since this method returns the complete power set, the space complexity is of the order of 2 ^ n. The time complexity is exponential.

## Iterative algorithm, same idea

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16  vector< vector > powerset2(const vector &arr) { int arr_size = arr.size(); vector< vector > pset; pset.push_back(vector()); for (int pos = 0; pos < arr_size; pos++) { vector< vector > tmp(pset); for (auto &subset : tmp) subset.push_back(arr[pos]); copy(tmp.begin(), tmp.end(), back_inserter(pset)); } return pset; } 

## Iterating over power set, using a bitmask (lexical ordering)

We can use a bitmask of length = size of input set to denote a subset choice. For example, a selection of {1, 2} in {1, 2, 3, 4} can be denoted by 0011, where the LSB (least significant bit) denotes 0th index and MSB denotes the highest possible index (arr.size() - 1). $$\phi$$ is denoted by 0000 and a selection of all integers is denoted by 1111.

According to this idea, each set in the powerset can be represented by a bitmask. Therefore, iterating over all possible bitmasks will do the trick. Note that all possible bitmasks of length n is simply [0 … 2^n - 1].

This solution is sufficient for most practical applications running on a single computer. I am going to use a 64-bit unsigned long long for this. If you have a set bigger than this, you cannot do it in a reasonable amount of time on a single machine.

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15  void powerset3(const vector &arr) { int arr_size = arr.size(); unsigned long long lim = (1 << arr_size) - 1; for (unsigned long long i = 0; i <= lim; i++) { unsigned long long mask = i; for (int idx = 0; idx < sizeof(mask) * 8; idx++) { if ((mask >> idx) & 1) cout << arr[idx] << " "; } cout << "\n"; } } 

# Iterating over power set, using banker’s sequence

Using banker’s sequence we can generate subsets in a monotonically increasing order of cardinality. Depending on your use case, it may be extremely useful. The idea is to use a bitmask as before but we will consider all bitmasks with set bits = k before we consider any mask with set bits > k.

  1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18  void powerset4(const vector &arr) { int arr_size = arr.size(); vector mask(arr_size, false); for (int i = 0; i <= arr_size; i++) { fill(mask.begin(), mask.end()-i, false); fill(mask.end()-i, mask.end(), true); do { for (int j = 0; j < arr_size; j++) { if (mask[j]) cout << arr[j] << " "; } cout << "\n"; } while(next_permutation(mask.begin(), mask.end())); } } 

## Conclusion

As Donald Knuth once remarked, there seems to be as many algorithms for unsorting data as there are for sorting it. There are many approaches and algorithms for power set generation. I hope I have provided a decent coverage of the most popular ones.