一种全排列的方式

void perm(int* data, int n, int curr){    if (curr==n-1)    {        for (int i = 0; i < n; ++i)            printf("%d", data[i]);        printf("\n");    }    else    {        for (int i = curr; i < n; ++i)        {            int t;            t = data[curr], data[curr] = data[i], data[i] = t;            perm(data, n, curr+1);            t = data[curr], data[curr] = data[i], data[i] = t;        }    }}

代码很神奇，自己还没理解透，先记着吧。比较笨拙。