Would the following modifications to Ovid's code (above) make it more flexible, or am I deluding myself? I would think then a modification to change sizes would be much easier.

• Add my $startwith = 3, $endafter = 16; before line 4
• In line 11, change 'zzzzzzzzzzzzzzzz' to read ('z' x $endafter);
• In line 18, replace 16 with $endafter

As to what you wish to do with the code, assuming you are only doing the range (0..9,a..z), you are performing the number of iterations equal to the summation of (36^n) for n from 3 to 16, which is a little less than 7.96e24 (but more than simply (36^16)). To give some perspective to it (if that can be done), if you can perform 1 billion loops per second, you can expect it to take approximately 252 million years to complete them all. Do you really want to do that?

Comments? Guidance?