Given an integer array (of length n), find and print all the subsets of input array.

TITLE:-

Print Subsets of Array

PROBLEM:-

Given an integer array (of length n), find and print all the subsets of input array.

Subsets are of length varying from 0 to n, that contain elements of the array. But the order of elements should remain same as in the input array.

Note : The order of subsets are not important. Just print the subsets in different lines.

Input format :

Line 1 : Integer n, Size of array
Line 2 : Array elements (separated by space)

Constraints :

1 <= n <= 15

Sample Input:

3
15 20 12

Sample Output:

[] (this just represents an empty array, don't worry about the square brackets)
12 
20 
20 12 
15 
15 12 
15 20 
15 20 12 

SOLUTION:-

#include <iostream>
using namespace std;

void psubset(int input[],int n,int output[],int m)
{
    if(n==0)
    {
        for(int i=0;i<m;i++)
            cout<<output[i]<<" ";
        cout<<endl;
        return;
    }
    
    int newout[m+1];
    int i;
    for(i=0;i<m;i++)
    {
        newout[i]=output[i];
    }
    newout[i]=input[0];
    psubset(input+1,n-1,newout,m+1);
    psubset(input+1,n-1,output,m);
}
void printSubsetsOfArray(int input[], int size) {
	// Write your code here
    int output[0];
    int m=0;
    psubset(input,size,output,m);
}




int main() {
  int input[1000],length;
  cin >> length;
  for(int i=0; i < length; i++)
  	cin >> input[i];
  printSubsetsOfArray(input, length);
}




• Tweet
• Share
• Share
• Share
• Share

About Admin MC3

This is dummy text. It is not meant to be read. Accordingly, it is difficult to figure out when to end it. But then, this is dummy text. It is not meant to be read. Period.

Related Post