c++ generate all subsets
#include <vector>
#include <iostream>
#include <cmath>
using namespace std;
int main() {
// this is the length of the array of values
// change variable "len" accordingly
int len = 5;
// this is the array of values
int values[] = {3, 4, 2, 8, 5};
// all subsets will be in vector "subsets"
vector<vector<int>> subsets;
for (int i = 0; i < pow(2, len); i++) {
int t = i;
vector<int> v;
for (int j = 0; j < len; j++) {
if (t & 1)
v.push_back(values[j]);
t >>= 1;
}
subsets.push_back(v);
}
// print all of the subsets (optional)
cout << "subsets:\n";
for (const vector<int>& subset: subsets) {
for (const int& value: subset)
cout << value << " ";
cout << "\n";
}
// note: an empty line will be printed at the top,
// indicating an empty subset
}
4.75
4
#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
// Function to print the elements of a vector
void printVector(vector<int> const &out)
{
for (int i: out)
cout << i << " ";
cout << '\n';
}
// Recursive function to print all distinct subsets of S
// S --> input set
// out --> vector to store subset
// i --> index of next element in set S to be processed
void findPowerSet(int S[], vector<int> &out, int i)
{
// if all elements are processed, print the current subset
if (i < 0)
{
printVector(out);
return;
}
// include current element in the current subset and recur
out.push_back(S[i]);
findPowerSet(S, out, i - 1);
// exclude current element in the current subset
out.pop_back(); // backtrack
// remove adjacent duplicate elements
while (S[i] == S[i-1])
i--;
// exclude current element in the current subset and recur
findPowerSet(S, out, i - 1);
}
// Program to generate all distinct subsets of given set
int main()
{
int S[] = { 1, 3, 1 };
int n = sizeof(S) / sizeof(S[0]);
// sort the set
sort(S, S + n);
// create an empty vector to store elements of a subset
vector<int> out;
findPowerSet(S, out, n-1);
return 0;
}
Thank you!
4
4.75
(4 Votes)
0
Are there any code examples left?
New code examples in category C++
Relative searches
find all unique subsets of array
generate all subset in c++
generate all unique subsets of an array
Print unique subsets And Variations
c++ generate all subsets n^2
print all unique subsets
generate all subsets c++
given an array print all unique subsets with a given sum
print unique subsets program
how do you generate subsets
generate all subsets in c++
subset of array cpp
generate all subset of string cpp
generate all unique subsets of a set
subsets of an array c++
finding all subsets of an array c++
how to generate subsets in c++
given a set of n elements print all subsets of the set using bit masking
Given an array arr[] of integers of size N that might contain duplicates, the task is to find all possible unique subsets
generate all subsets of size k c++
generate subsets in with unique and duplicate values
generate subsets in C++
how to get all subsets of a list in python using bitmasking
generate all subsets most effective way c++
produce every subset in optimized
creating subset using bitmasking
all subsequences of an array using bit masking
subsets of array in c++
how to make a subset in c++
subset of array c++ inbuilt function
print all subsets of an array c++
find subsets of an integer array with distinct elements
print all subset of all length
generating all the sub seta of array bit masking
find subset in c++
how to find all subset of a set in c++
continous subset of a set cpp
print all possible sub=sets of a string in cpp
subset of a set gfg
print all subsets of a set c++
subset of array in cpp
find repeated substt
subsets of array cpp
generate subset in c++
dynamic programming dind all subsets of a string
print subsets in c++
all subsets of an array c++
subsets of a set c++
generate subsets of set c++
generate subsets using bitmasking
subset of a number gfg
c++ get all subsets
print subsets of an array in c++
print unique subsets
find all distinct subsets of a given set having duplicate value
find all subset of array having duplicate
subsets generator c++
subset generation without single elements c++
subset generation c++
unique subset
print all subset c++
subsets in array c++
program for finding the subset of a number
find all subsets of an array c++
Find all distinct subsets of a given set
print all subsets of an array in c++
Find all distinct subsets of a given set backtracking
select subset of array cpp
generate all subsets of a vector c++
subset c++
subset in c++
finding all subsets of an array in c++
find number o subset in an array c++
all subset of a set c++
generate ordered sequence subsets of sets c++
subsets in c++
find all distinct subsets of a given array
all possible subsets of an array c++
subsets of set c++
subset of array c++
how to make subsets in c++
print all unique subset of array
subset() in c++
al subsets in c++
c++ generate all subsets
