Anonymous Monk has asked for the wisdom of the Perl Monks concerning the following question:

Sorry, I am very frustrated right now. I have spent the last six hours trying to come up with a simple perl program to list all permutations for the numbers from one to five (the use of cpan modules is not allowed for this exercise).

The well-known algorithm and code snippets in other languages can be found here:

One python implementation is very brief and almost understandable (though my python knowledge is even poorer than my perl knowledge):

def permute(in_str, prefix=""): if not len(in_str) : print(prefix) else: for i in range(0, len(in_str)): permute(in_str[:i] + in_str[i + 1:], prefix + in_str[i]) permute('12345')
The biggest problem is (even after reading man perlsub for over an hour), I just don't understand the calling syntax. My attempt is looking something like this (which generates a huge number of syntax errors and won't run).
#!/usr/bin/perl -w use strict; my @array = 1..5; while (permute @array) sub permute { my @temp; while ( $#temp < $#_) { my $i; for ($i = $#temp; $i < $#_; $i++) { swap @_[$i] @_[$#temp]; permute; swap @_[$i] @_[$#temp]; } } print $_; } sub swap { my $k; my $l; my $temp; $temp = $k; $k = $l; $l = $temp; }

Can someone guide me in the right direction. Clever techniques are not important. What is important is that I understand what is going on.

Thank you (very much) in advance.