subconjuntos de uma determinada matriz
// C++ code to print all possible
// subsequences for given array using
// recursion
#include <bits/stdc++.h>
using namespace std;
// Recursive function to print all
// possible subsequences for given array
void printSubsequences(int arr[], int index,
vector<int> subarr,int n)
{
// Print the subsequence when reach
// the leaf of recursion tree
if (index == n)
{
for (auto it:subarr){
cout << it << " ";
}
if(subarr.size()==0)
cout<<"{}";
cout<<endl;
return;
}
else
{
//pick the current index into the subsequence.
subarr.push_back(arr[index]);
printSubsequences(arr, index + 1, subarr,n);
subarr.pop_back();
//not picking the element into the subsequence.
printSubsequences(arr, index + 1, subarr,n);
}
}
// Driver Code
int main()
{
int arr[]={1, 2, 3};
int n=sizeof(arr)/sizeof(arr[0]);
vector<int> vec;
printSubsequences(arr, 0, vec,n);
return 0;
}
// This code is contributed by
// vivekr4400
Zany Zebra