数组全排列

    #include <iostream> using namespace std; void perm(int a[], int k, int n) { if (k < n-1) { int i, t; for (i=k; i<n; i++) { t = a[k]; a[k] = a[i]; a[i] = t; perm(a, k+1, n);

>>阅读原文<<