/* I know there are easier and faster ways to generate permutations, I just couldn't find a good way to print them out in order, so I made this instead... */ #include using namespace std; void comb(int input[], int n); void comb_all(int input[], int n); void comb_length(int input[], int n, int length); void k(int p[], int r[], int pn, int rn, int max); int main() { int input[] = {1,2,3}; comb(input, 3); return 0; } /* prints out every possible combination that uses each element of input exactly once. n is the size of input*/ void comb(int input[], int n){ k(NULL, input, 0, n, -1); } /* prints out every possible combination that uses each element of input once or less. n is the size of input*/ void comb_all(int input[], int n){ int i; for(i = 1; i <= n; i++){ k(NULL, input, 0, n, i); } } /* prints out every possible combination that uses each element of input once or less. the combinations will contain length elements. n is the size of input*/ void comb_length(int input[], int n, int length){ k(NULL, input, 0, n, length); } /* here does the magic happen! */ void k(int p[], int r[], int pn, int rn, int max){ int i; if(!max){ int t; for(t = 0; t < pn; t++){ cout << p[t]; } cout << endl; return; } for(i = 0; i < rn; i++){ if(rn > 1){ int t = 0, l = 0; int nr[rn-1]; int np[pn+1]; for(; l

Integer Permutations (in Order)