//全排列
#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
//排列树
void Perm(int *br,int k,int m)
{
if(k==m)
{
for(int i=0;i<=m;++i)
{
cout<<br[i]<<endl;
}
cout<<endl;
}
else
{
for(int j=k;j<=m;++j)
{
swap(br[j],br[k]);
Perm(br,k+1,m);
swap(br[j],br[k]);
}
}
}
int main()
{
int ar[]={1,2,3};
int n=sizeof(ar)/sizeof(ar[0]);
Perm(ar,0,n-1);
}