Quote:Edit: This worked when I used alpha chars, which is what I want) to do), but when I used anything longer than 7 characters, it gave no result.
these are permutations, there are n! for n elements
N! = 1, 2, 6, 24, 120, 720, 5040, 40320, 362880, 3628800, ....
that sequence expands faster than any x^n ie expedentially plus!
you propably didn't get results because you didn't wait long enough plus real easy to go beyond the limits of the type fairly quickly.
that routine steve provided i think was better than what i had, except maybe the non recursive one?
i filed the data for 10 letters or digits so i could use a substitution technique for 10 of anything without recalculating permutaions of 10 things because it takes so long.
b = b + ...