How to generate 26^3 in letters using a loop

[Teckx]

I’m comfortable with autoit but I’ve run into a wall. I can’t think of a method on how to generate all unique combinations of a-z at 3 characters long

aaa

aab

etc

[Nine]

$Letters  = StringSplit("a,b,c,d,e,f,g,h,i,j,k,l,m,n,o,p,q,r,s,t,u,v,w,x,y,z", ",")
Combi("", 3)

Func Combi($Str, $MaxLen)
  if StringLen($Str) = $MaxLen Then
    FileWriteLine("Test.txt", "Letters list = " & $Str)
    Return
  EndIf
  For $i = 1 to $Letters[0]
    Combi($Str & $Letters[$i], $MaxLen)
  Next
EndFunc

 

[Teckx]

Thank you

ill give this a go!

[jdelaney]

$A = 65
For $i = 0 to 25
    For $j= 0 to 25
        For $k = 0 to 25
            ConsoleWrite(Chr($A+$i) & Chr($A+$j) & Chr($A+$k) & @CRLF)
        Next
    Next
Next

Edit: didn't know why I put in 32...25 starting from 0 is correct.

 

I do like the recursion used in the other example though.

Edited January 23, 2019 by jdelaney