Beefy Boxes and Bandwidth Generously Provided by pair Networks
P is for Practical
 
PerlMonks  

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

by daxim (Chaplain)
on Feb 26, 2013 at 12:31 UTC ( #1020680=note: print w/ replies, xml ) Need Help??


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

"uniform permutations" don't exist, at least not what you describe. Your number 4 is just the count of the elements of the input again, one does not need any algorithm to arrive at that conclusion.
  • Comment on Re: How can one generate all possible permutations of r elements out of n where r<n?

Replies are listed 'Best First'.
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

    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

Log In?
Username:
Password:

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

How do I use this? | Other CB clients
Other Users?
Others making s'mores by the fire in the courtyard of the Monastery: (3)
As of 2016-08-26 23:58 GMT
Sections?
Information?
Find Nodes?
Leftovers?
    Voting Booth?
    The best thing I ever won in a lottery was:















    Results (375 votes). Check out past polls.