Perl: the Markov chain saw | |
PerlMonks |
Re: sort with fewest movesby jlongino (Parson) |
on Feb 10, 2002 at 17:21 UTC ( [id://144477]=note: print w/replies, xml ) | Need Help?? |
If this were homework (but of course it's not), I imagine a
teacher would be very impressed if one of their students
developed a uniquely Perl solution. Instead of trying to
move elements around one at a time, come up with an
algorithm to swap at least two elements.
For example, with Perl you could solve this specific problem with the following two statements: and, of course, with one statement: Coming up with an algorithm for two in-place swaps shouldn't be too difficult (I've already shown you the Perl idiom), ++ if you can handle more than two elements at a time. --Jim Update: Well, that's the algorithm part I alluded to, your list of moves for the 2-element swap would look like this:
If we'd known that you had to use a one-armed robot to begin with, the replies might have been more useful. ;)
In Section
Seekers of Perl Wisdom
|
|