Question

I know from Algebra class that with ABC and 123 we can make 216 different permutations for a three letter string, right? (6 x 6 x 6) I’d like to create a console program in C++ that displays ever possible permutation for the example above. The thing is, how would I even begin trying to calculate them. Perhaps:

AAA
BAA
CAA
1BA
2BA
3CA
1AB
2BC
3CA

etc.

This is really hard to ask, but what would I have to do to ensure that I include every permutation? I know there are 216 but I don’t know how to actually go about going through all of them.

Any suggestions would be greatly appreciated!!!

Answer 1

If you need a fixed-number strings, you can use N nested loops (three in your case).

string parts = "ABC123";
for (int i = 0 ; i != parts.size() ; i++)
    for (int j = 0 ; j != parts.size() ; j++)
        for (int k = 0 ; k != parts.size() ; k++)
            cout << parts[i] << parts[j] << parts[k] << endl;

If N is not fixed, you would need a more general recursive solution.