Sorting algorithms/Strand sort: Difference between revisions

<lang Perl>use 5.10.0strict; # for given/when

my ($x, $y) = @_;

my @out;

while (@$x and @$y) {

my $t = given ($x->[-1] <=> $y->[-1]) {;

if ($t when(== 1) { unshift @out, pop @$x }

elsif ($t == when(-1) { unshift @out, pop @$y }

else default { splice @out, 0, 0, pop(@$x), pop(@$y) }

}

@$x, @$y, }@out

my $x = shift;

my @out = shift @$x // return;

iffor (-@$x .. -1) {

push @out, splice @$x, $_, 1 if for (-@$x->[$_] ..>= $out[-1) {];

my @x = @_;

my(@out, @outstrand);

@out = merge \@out, \@strand while (my @strand = strand(\@x)) {;