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

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.

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

Replies are listed 'Best First'.
Re^3: How can one generate all possible permutations of r elements out of n where r<n? by marto (Cardinal) on Feb 27, 2013 at 09:21 UTC
perlintro, perlrun, http://learn.perl.org. Update: you claim this code solved your problem, yet it didn't include `#!/usr/bin/perl`	[reply] [d/l]


The stupid question is the question not asked
	PerlMonks