Sorting algorithms/Gnome sort: Difference between revisions

Line 216:
sub gnome_sort
{
my $aref@a = shift@_;
 
my $size = scalar(@$arefa);
my $i = 1;
my $j = 2;
while($i < $size) {
if ( ${$aref}a[$i-1] <= ${$aref}a[$i] ) {
$i = $j;
$j++;
} else {
my@a[$i, $ti-1] = ${$aref}@a[$i-1, $i];
${$aref}[$i-1] = ${$aref}[$i];
${$aref}[$i] = $t;
$i--;
if ($i == 0) {
Line 236 ⟶ 234:
}
}
return $aref@a;
}</lang>
 
<lang perl>my @arr = ( 10, 9, 8, 5, 2, 1, 1, 0, 50, -2 );
print join("$_\n", @{foreach gnome_sort( \@arr )});</lang>
exit 0</lang>
 
=={{header|Python}}==
Anonymous user