全排列

#include<iostream>
using namespace std;
void Arrangement(int list[],int k,int m)
{
	if(k==m)
	{
		for(int i=0;i<=m;i++)
		{
			cout<<list[i]<<" ";
		}
		cout<<endl;
	}
	else
	{
		for(int j=k;j<=m;j++)
		{
			swap(list[k],list[j]);
			Arrangement(list,k+1,m);
			swap(list[k],list[j]);
		}
	}
}
int main()
{
	int list[]={1,2,3,4,5,6};
	Arrangement(list,0,3);
	return 0;
}

#include <iostream>

using namespace std;
int total = 0;
//交换函数
void swapArray(int &a,int &b)
{
    int temp;
    temp = a;
    a = b;
    b = temp;
}
//递归函数
void fullPermutation(int * fullArray,int start,int end,int number){
    if(start==end){
        for(int i=0;i<number;i++){
            cout<<fullArray[i];
        }
        cout<<endl;
        total++;
    }
    else{
        for(int i=start;i<=end;i++){
            swapArray(fullArray[start],fullArray[i]);//交换
            fullPermutation(fullArray,start+1,end,number);
            swapArray(fullArray[start],fullArray[i]);//恢复原样
        }
    }
}
int main()
{
    int number;//全排列的长度
    cout<<"Number:"<<endl;
    cin>>number;
    int * fullArray = new int[number];//动态生成全排列的数组
    //初始化
    for (int i=0;i<number;i++)
    {
        fullArray[i] = i+1;
    }
    fullPermutation(fullArray,0,number-1,number);
    cout<<"Total = "<<total;
    return 0;
}