I have code that will produce every combination of chars for a given char set so say char set a-z for 8 string length would give every combination like aaaaaaaa-zzzzzzzz.
This is produces a big file.
However I see you can also produce permutations which seem to be unique outputs of a given char set. This code seems to do that,
Find all permutations of a string in C++ (Using Backtracking and STL) - Techie Delight
How would I modify this code so it produces an 8 char output instead of 3?