递归实现全排列:
#include
#define N 4
int used[N];
int out[N];
void f(int *num,int n,int p);
int main()
{
int num[N],i;
for(i=0;i[......]
递归实现全排列:
#include
#define N 4
int used[N];
int out[N];
void f(int *num,int n,int p);
int main()
{
int num[N],i;
for(i=0;i[......]