Permutations by swapping: Difference between revisions

(corrected C++ as requested in task maintenance page)
Line 904:
 
=== Recursive ===
 
{{Broken}}
<lang perl6>sub insert($x, @xs) { ([@xs[0..$_-1], $x, @xs[$_..*]] for 0..+@xs).flat }
sub order($sg, @xs) { $sg > 0 ?? @xs !! @xs.reverse }
 
Line 920:
{{out}}
<pre>
[0, 1, 2] => 1
[1, 0, 2] => -1
[1, 2, 0] => 1
[2, 1, 0] => -1
[2, 0, 1] => 1
[0, 2, 1] => -1
</pre>
 
Anonymous user