Code:
#include iostream
using namespace std;
// A function to print all combination of a given length from the given array.
void GenSubSet(int a[], int reqLen, int start, int currLen, bool check[], int len)
{
// Return if the currrLen is more than the required length.
if(currLen > reqLen)
return;
// If currLen is equal to required length then print the sequence.
else if (currLen == reqLen)
{
cout<<"\t";
for (int i = 0; i < len; i++)
{
if (check[i] == true)
{
cout<
}
}
cout<<"\n";
return;
}
// If start equals to len then return since no further element left.
if (start == len)
{
return;
}
// For every index we have two options.
// First is, we select it, means put true in check[] and increment currLen and start.
check[start] = true;
GenSubSet(a, reqLen, start + 1, currLen + 1, check, len);
// Second is, we don't select it, means put false in check[] and only start incremented.
check[start] = false;
GenSubSet(a, reqLen, start + 1, currLen, check, len);
}
int main()
{
int i, n, k;
bool check[n];
cout<<"Enter the number of element array have: ";
cin>>n;
int arr[n];
cout<<"\n";
// Take the input of the array.
for(i = 0; i < n; i++)
{
cout<<"Enter "<
cin>>arr[i];
check[i] = false;
}
cout<<"\nEnter the length of the subsets required: ";
cin>>k;
cout<<"\nThe combination of length "<
GenSubSet(arr, k, 0, 0, check, n);
return 0;
}
Output:
Case 1:
Enter the number of element array have: 8
Enter 1 element: 1
Enter 2 element: 5
Enter 3 element: 3
Enter 4 element: 2
Enter 5 element: 8
Enter 6 element: 4
Enter 7 element: 6
Enter 8 element: 7
Enter the length of the subsets required: 3
The combination of length 3 for the given array set:
1 5 3
1 5 2
1 5 8
1 5 4
1 5 6
1 5 7
1 3 2
1 3 8
1 3 4
1 3 6
1 3 7
1 2 8
1 2 4
1 2 6
1 2 7
1 8 4
1 8 6
1 8 7
1 4 6
1 4 7
1 6 7
5 3 2
5 3 8
5 3 4
5 3 6
5 3 7
5 2 8
5 2 4
5 2 6
5 2 7
5 8 4
5 8 6
5 8 7
5 4 6
5 4 7
5 6 7
3 2 8
3 2 4
3 2 6
3 2 7
3 8 4
3 8 6
3 8 7
3 4 6
3 4 7
3 6 7
2 8 4
2 8 6
2 8 7
2 4 6
2 4 7
2 6 7
8 4 6
8 4 7
8 6 7
4 6 7
More C++ Programs:
