Permutations by swapping: Difference between revisions

ch := SubStr(str, 1, 1) ; get left-most charachter of str

for each, line in StrSplit(list, "`n") ; for each line in list

loop % StrLen(line) + 1 ; loop each possible position

Newlist .= RegExReplace(line, mod(order,2) ? "(?=.{" A_Index-1 "}$)" : "^.{" A_Index-1 "}\K", ch) "`n"

if !str := SubStr(str, 2) ; remove charachter from left hand side

return list ; done if str is empty

return Permutations_By_Swapping(str, list) ; else recurse

Outputs:<pre>4321 Sign: 1

4231 Sign: 1

2431 Sign: -1

2341 Sign: 1

2314 Sign: -1

2134 Sign: -1

4312 Sign: 1

3412 Sign: -1

3142 Sign: 1

3124 Sign: -1

4132 Sign: 1

1432 Sign: -1

1342 Sign: 1

1324 Sign: -1

4123 Sign: 1

1423 Sign: -1

1243 Sign: 1

1234 Sign: -1</pre>