全排列问题:
#include<iostream>
using namespace std;
void permutation(char* a,int k,int m)
{
int i,j;
static int count = 1;
if(k == m)
{ cout << "第" << count++ << "种方法是: ";
for(i=0;i<=m;i++)
cout<<a[i];
cout<<endl;
}
else
{
for(j=k;j<=m;j++)
{
swap(a[j],a[k]);
permutation(a,k+1,m);
swap(a[j],a[k]);
}
}
}
int main(void)
{
char a[] = "abc";
cout<<a<<"所有全排列的结果为:"<<endl;
permutation(a,0,2);
system("pause");
return 0;
}
组合问题:
#include <iostream>
using namespace std;
int Count = 0;
void build(char *str,int *tag,int n)
{
if(n==4)
{
cout<<++Count<<" {";
for(int i=0;i<4;i++)
if(tag[i]==1)
cout<<str[i] << ",";
cout<<"}"<<endl;
return;
}
tag[n] = 0;
build(str,tag,n+1);
tag[n] = 1;
build(str,tag,n+1);
}
int main()
{
char a[4]={'a','b','c','d'};
int tag[4];
build(a,tag,0);
return 0;
}