How to Efficiently Generate the Power Set of a Set in Java?

Generating the Powerset of a Set in Java

The powerset of a set is the set of all subsets of that set. For example, the powerset of {1, 2, 3} is:

{{}, {2}, {3}, {2, 3}, {1, 2}, {1, 3}, {1, 2, 3}, {1}}

Suppose we have a Set in Java:

Set<integer> mySet = new HashSet<integer>();
mySet.add(1);
mySet.add(2);
mySet.add(3);
Set<set>> powerSet = getPowerset(mySet);</set></integer></integer>

How can we write the getPowerset function with the optimal time complexity?

Solution

The time complexity of the powerset function is O(2^n), where n is the number of elements in the set. This is because the powerset of a set with n elements contains 2^n subsets.

Here's a working implementation of the getPowerset function using generics and sets:

public static <t> Set<set>> powerSet(Set<t> originalSet) {
    Set<set>> sets = new HashSet<set>>();
    if (originalSet.isEmpty()) {
        sets.add(new HashSet<t>());
        return sets;
    }
    List<t> list = new ArrayList<t>(originalSet);
    T head = list.get(0);
    Set<t> rest = new HashSet<t>(list.subList(1, list.size())); 
    for (Set<t> set : powerSet(rest)) {
        Set<t> newSet = new HashSet<t>();
        newSet.add(head);
        newSet.addAll(set);
        sets.add(newSet);
        sets.add(set);
    }       
    return sets;
}  </t></t></t></t></t></t></t></t></set></set></t></set></t>

Test

Let's test the getPowerset function with the given example input:

Set<integer> mySet = new HashSet<integer>();
mySet.add(1);
mySet.add(2);
mySet.add(3);
for (Set<integer> s : powerSet(mySet)) {
     System.out.println(s);
}</integer></integer></integer>

This will print the following output:

[]
[1]
[2]
[1, 2]
[3]
[1, 3]
[2, 3]
[1, 2, 3]

The above is the detailed content of How to Efficiently Generate the Power Set of a Set in Java?. For more information, please follow other related articles on the PHP Chinese website!