All Combinations of the alphabet

[_uj]

Originally posted by jrlambs
Ok, so these are giving me all permutations, I need all combinations... I don't cae about the difference between ABC and ACB. only about the difference between ABC and ABE and ABF etc etc etc.

All you have to do is to use nested loops. If you have say 10 letters and want all 3-letter groups just,

for (int i=0; i<10; i++)
   for (int j=0; j<10; j++)
      for (int k=0; k<10; k++) 
           // print the i,j,k letter combination

If you don't want to hardcode the nesting depth you can use recursion. Basically you have a function with one loop. The equivalence of entering a deeper nesting level would be to make a recursive call to that function.