Beefy Boxes and Bandwidth Generously Provided by pair Networks Cowboy Neal with Hat
The stupid question is the question not asked
 
PerlMonks  

Re^2: How can one generate all possible permutations of r elements out of n where r<n?

by supriyoch_2008 (Scribe)
on Feb 27, 2013 at 09:18 UTC ( #1020832=note: print w/ replies, xml ) Need Help??


in reply to Re: How can one generate all possible permutations of r elements out of n where r<n?
in thread How can one generate all possible permutations of r elements out of n where r<n?

Hi daxim,

Thanks for providing the information. It is true that uniform permutations don't exist. I used the term since I could not gather the appropriate term for permuations like AAA,TTT,GGG,CCC etc.

With regards


Comment on Re^2: How can one generate all possible permutations of r elements out of n where r<n?

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others browsing the Monastery: (6)
As of 2014-04-20 19:42 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?

    April first is:







    Results (487 votes), past polls