Beefy Boxes and Bandwidth Generously Provided by pair Networks
Don't ask to ask, just ask
 
PerlMonks  

Re^2: Fastest way to do permutations with replacement

by wdef2 (Acolyte)
on Apr 16, 2008 at 19:24 UTC ( #680902=note: print w/ replies, xml ) Need Help??


in reply to Re: Fastest way to do permutations with replacement
in thread Fastest way to do permutations with replacement

Thanks Monks for the replies. Algorithm::Combinatorics appears to do this with:

variations_with_repetition(\@data, $k)

which is probably the correct name for it.

As far as a brute force cracker goes, the question then might be: is it more efficient to use Alorithm::Combinatronics in XScode and no threading, or divide the namespace into slabs for each thread of an Algorithm::Loop threaded implementation.


Comment on Re^2: Fastest way to do permutations with replacement
Re^3: Fastest way to do permutations with replacement
by wdef2 (Acolyte) on Apr 16, 2008 at 21:17 UTC
    Those who wish to peruse or berate my humble code as fumbling heresy may find it here:

    http://damnsmalllinux.org/cgi-bin/forums/ikonboard.cgi?act=ST&f=23&t=19676&st=60&&#entry101014

    But please send me for flagellation back here and not there, since I am the only candidate for entry to the Perlmonks novitiate in that spartan flock, almost none of whom seem to speak any of the Prophet Larry's programming language.

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others surveying the Monastery: (5)
As of 2015-07-04 00:01 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    The top three priorities of my open tasks are (in descending order of likelihood to be worked on) ...









    Results (57 votes), past polls