Skip to content

Commit 373fb88

Browse files
committed
feat: Add GenerateSubsets new algorithm with Junit tests
1 parent 2a518e3 commit 373fb88

File tree

2 files changed

+96
-0
lines changed

2 files changed

+96
-0
lines changed
Lines changed: 44 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,44 @@
1+
package com.thealgorithms.bitmanipulation;
2+
3+
import java.util.ArrayList;
4+
import java.util.List;
5+
6+
/**
7+
* This class provides a method to generate all subsets (power set)
8+
* of a given set using bit manipulation.
9+
*
10+
* @author Hardvan
11+
*/
12+
public final class GenerateSubsets {
13+
private GenerateSubsets() {
14+
}
15+
16+
/**
17+
* Generates all subsets of a given set using bit manipulation.
18+
* Steps:
19+
* 1. Iterate over all numbers from 0 to 2^n - 1.
20+
* 2. For each number, iterate over all bits from 0 to n - 1.
21+
* 3. If the i-th bit of the number is set, add the i-th element of the set to the current subset.
22+
* 4. Add the current subset to the list of subsets.
23+
* 5. Return the list of subsets.
24+
*
25+
* @param set the input set of integers
26+
* @return a list of all subsets represented as lists of integers
27+
*/
28+
public static List<List<Integer>> generateSubsets(int[] set) {
29+
int n = set.length;
30+
List<List<Integer>> subsets = new ArrayList<>();
31+
32+
for (int mask = 0; mask < (1 << n); mask++) {
33+
List<Integer> subset = new ArrayList<>();
34+
for (int i = 0; i < n; i++) {
35+
if ((mask & (1 << i)) != 0) {
36+
subset.add(set[i]);
37+
}
38+
}
39+
subsets.add(subset);
40+
}
41+
42+
return subsets;
43+
}
44+
}
Lines changed: 52 additions & 0 deletions
Original file line numberDiff line numberDiff line change
@@ -0,0 +1,52 @@
1+
package com.thealgorithms.bitmanipulation;
2+
3+
import static org.junit.jupiter.api.Assertions.assertEquals;
4+
5+
import java.util.ArrayList;
6+
import java.util.Arrays;
7+
import java.util.List;
8+
import org.junit.jupiter.api.Test;
9+
10+
class GenerateSubsetsTest {
11+
12+
@Test
13+
void testGenerateSubsetsWithTwoElements() {
14+
int[] set = {1, 2};
15+
List<List<Integer>> expected = new ArrayList<>();
16+
expected.add(new ArrayList<>());
17+
expected.add(Arrays.asList(1));
18+
expected.add(Arrays.asList(2));
19+
expected.add(Arrays.asList(1, 2));
20+
21+
List<List<Integer>> result = GenerateSubsets.generateSubsets(set);
22+
assertEquals(expected, result);
23+
}
24+
25+
@Test
26+
void testGenerateSubsetsWithOneElement() {
27+
int[] set = {3};
28+
List<List<Integer>> expected = new ArrayList<>();
29+
expected.add(new ArrayList<>());
30+
expected.add(Arrays.asList(3));
31+
32+
List<List<Integer>> result = GenerateSubsets.generateSubsets(set);
33+
assertEquals(expected, result);
34+
}
35+
36+
@Test
37+
void testGenerateSubsetsWithThreeElements() {
38+
int[] set = {4, 5, 6};
39+
List<List<Integer>> expected = new ArrayList<>();
40+
expected.add(new ArrayList<>());
41+
expected.add(Arrays.asList(4));
42+
expected.add(Arrays.asList(5));
43+
expected.add(Arrays.asList(4, 5));
44+
expected.add(Arrays.asList(6));
45+
expected.add(Arrays.asList(4, 6));
46+
expected.add(Arrays.asList(5, 6));
47+
expected.add(Arrays.asList(4, 5, 6));
48+
49+
List<List<Integer>> result = GenerateSubsets.generateSubsets(set);
50+
assertEquals(expected, result);
51+
}
52+
}

0 commit comments

Comments
 (0)