Beefy Boxes and Bandwidth Generously Provided by pair Networks
The stupid question is the question not asked

Re: Character Combinations

by chunlou (Curate)
on Aug 22, 2003 at 23:00 UTC ( [id://285950]=note: print w/replies, xml ) Need Help??

in reply to Character Combinations

Why not use List::Permutor or Algorithm::FastPermute?
use Algorithm::FastPermute; my @c = 'a'..'c'; permute {print "@c\n"} @c; __END__ a b c a c b c a b b a c b c a c b a

Replies are listed 'Best First'.
Re: Re: Character Combinations
by Limbic~Region (Chancellor) on Aug 22, 2003 at 23:06 UTC
    Permutations are not combinations. For instance - say I wanted to find all combinations of 4 character strings with each position able to be 26 different letters. This is what I believe is being asked for. I am pretty sure there is an iterative solution - but all I can come up with right now are recursive ones.

    Cheers - L~R

    A reply falls below the community's threshold of quality. You may see it by logging in.

Log In?

What's my password?
Create A New User
Domain Nodelet?
Node Status?
node history
Node Type: note [id://285950]
and the web crawler heard nothing...

How do I use this?Last hourOther CB clients
Other Users?
Others having an uproarious good time at the Monastery: (4)
As of 2024-04-17 00:26 GMT
Find Nodes?
    Voting Booth?

    No recent polls found