（算法设计技巧与分析）Permutationsi

#include<iostream>using namespace std;void Permutationsi(int a[],int k,int n);int main(){int a[5];for(int i=0;i<3;i++)a[i]=i+1;Permutationsi(a,0,3);return 0;}void Permutationsi(int a[],int k,int n){//注意当a[j]和a[k]在递归调用后交换回来if(k==n-1){for(int i=0;i<n;i++)cout<<a[i]<<" ";cout<<endl;}else{int temp;for(int j=k;j<n;j++){temp=a[j];a[j]=a[k];a[k]=temp;Permutationsi(a,k+1,n);temp=a[j];//这是p[k..n]=m,m+1,...,na[j]=a[k];a[k]=temp;}}}