2009/10/26 Michael Alipio :
> Then as suggested (see far below), a recursive function will do what I want..
> After some googling I found this:
>
>
> permutate(0,2);
>
> sub permutate($$){
>
> my ($cur,$max) = @_;
>
> if ($cur>=$max){
> print "$result\n";
> return;
> }
>
> for(@word){
hi,
I have this code, mentioned below:
my @word = qw(a b c );
my $length = @word;
my $char1, $char2, $char3;
if ($length == 3){
for ($char1 = 0; $char1<$len;$char1++){
for ($char2 = 0; $char2<$len;$char2++){
for ($char3 = 0; $char3<$len;$char3++){
print "$word[$char1]$word[$char2]$word[$c
2009/10/25 Michael Alipio :
> I'm trying to write a word list generator which can
> generate all possible combinations of n characters, within n
> set of characters.
Have you looked into the magical autoincrement operator?
http://perldoc.perl.org/perlop.html#Auto-increment-and-Auto-decrement
I was thinking about this recursive thing... thanks for the tip.. will try this
out.. I hope I can accomplish it.
--- On Sun, 10/25/09, Gabor Szabo wrote:
> From: Gabor Szabo
> Subject: Re: compact my wordlist generator
> To: "Michael Alipio"
> Cc: "begginer
2009/10/25 Michael Alipio :
> Hi,
>
> I'm trying to write a word list generator which can
> generate all possible combinations of n characters, within n
> set of characters.
>
>
> So far, this is what I have come up. The only input is the
> lenght of the password the user wants.
>
> my @set =
