Anonymous user
Sorting algorithms/Bead sort: Difference between revisions
→{{header|Perl}}: add Perl 6 entry where it belongs
(→{{header|Perl 6}}: delete out of place entry) |
(→{{header|Perl}}: add Perl 6 entry where it belongs) |
||
Line 452:
beadsort 5, 7, 1, 3, 1, 1, 20;
</lang>
=={{header|Perl 6}}==
{{trans|Haskell}}
<lang perl6>use List::Utils;
sub beadsort(@l) {
(transpose(transpose(map {[1 xx $_]}, @l))).map(*.elems);
}
my @list = 2,1,3,5;
say beadsort(@list).perl;</lang>
Output:
<pre>(5, 3, 2, 1)</pre>
=={{header|Python}}==
| |||