写一个递归程序,求解集合的全部子集
#include<iostream>
using namespace std;
tmplate <class T>
void Func(T a[],int arry[],int index,int len){
if(index==len){
cout<<"{";
for(int i=0;i<len;i++){
if(arry[i]==1)
cout<<a[i];
}
cout<<"}"<<endl;
}
else{
arry[index]=0;
Func(a,arry,index+1,len);
arry[index]=1;
Func(a,arry,index+1,len);
}
}
int main(){
char a[]={"a","b","c","d","e"};
int arry[5];
Func(a,arry,0,5);
return 0;
}