全排列代码

#include<iostream>using namespace std;void swap(int *a,int *b){int temp=*a;*a=*b;*b=temp;}void permu(int list[],int k, int m){if(k>m){for(int i=0;i<=m;++i)cout<<list[i];cout<<endl;return ;}for(int i=k;i<=m;++i){swap(list[i],list[k]);permu(list,k+1,m);swap(list[i],list[k]);}}int main(){int list[]={1,2,3};int len=sizeof(list)/sizeof(int);permu(list,0,len-1);return 0;}