将数1——N进行全排列（递归）

//全排列
#include <stdio.h>
int count=0;
int swap(int *c,int *b){
	int tmp;
	tmp = *c;
	*c = *b;
	*b = tmp;
}
int fun(int *a,int left,int right,int len){
	int i;
	if(left==right){
		count++;
		for(i=0;i<len;i++){
			printf("%d",a[i]);
		}
		printf("\n");
	}
	else{
		for(i=left;i<=right;i++){
			swap(&a[i],&a[left]);
			fun(a,left+1,right,len);
			swap(&a[i],&a[left]);
		}
	}
	return count;	
} 
int main(){
	int n,i;
	while(scanf("%d",&n)){
	int a[n];
	for(i=0;i<n;i++){
		a[i] = i+1;
	}
	count=fun(a,0,n-1,n);
	printf("有%d种排列",count);
	}
	return 0;
}