Beefy Boxes and Bandwidth Generously Provided by pair Networks
There's more than one way to do things

Re: recursively generating permutations

by rnahi (Curate)
on Aug 19, 2005 at 11:20 UTC ( #485069=note: print w/replies, xml ) Need Help??

in reply to recursively generating permutations

You should look at Algorithm::Loops, and, through Super Search, to the following PM links:


  • Comment on Re: recursively generating permutations

Replies are listed 'Best First'.
Re^2: recursively generating permutations
by spurperl (Priest) on Aug 19, 2005 at 11:33 UTC
    Hi rnahi,

    Thanks for the many links, but it's not exactly *it*. The first link you give (Permutations and combinations) talks about a different kind of permutations. The second presents a non-recursive algorithm for lexicographic order permutations. The third's title says it all.

Log In?

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

How do I use this? | Other CB clients
Other Users?
Others contemplating the Monastery: (6)
As of 2018-08-16 19:23 GMT
Find Nodes?
    Voting Booth?
    Asked to put a square peg in a round hole, I would:

    Results (171 votes). Check out past polls.