http://www.perlmonks.org?node_id=1020680


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 (Monk) 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

[reply]

In Section Seekers of Perl Wisdom