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

C:\test>perl -MAlgorithm::Combinatorics=variations -E"$i=variations( [
+'A'..'D'], 3 ); say @$_ while $_= $i->next"
ABC
ABD
ACB
ACD
ADB
ADC
BAC
BAD
BCA
BCD
BDA
BDC
CAB
CAD
CBA
CBD
CDA
CDB
DAB
DAC
DBA
DBC
DCA
DCB

[download]
With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
"Science is about questioning the status quo. Questioning authority".
In the absence of evidence, opinion is indistinguishable from prejudice.
  • Comment on Re: How can one generate all possible permutations of r elements out of n where r<n?
  • Download Code

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:11 UTC

    Hi BrowserUK,

    Thank you very much for the code. But I am sorry that I do not understand the code as it does not start with #!/usr/bin/perl, the code I am a little acquainted with.

    With regards.

[reply]
[reply]
[d/l]

In Section Seekers of Perl Wisdom