Sorting algorithms/Insertion sort: Difference between revisions

→‎{{header|Perl}}: perlcritic(isms): DON't (ab)use unpack @_ assignment to also create local vars! constrain var scope; use return keyword
m (add link to Delphi for pascal)
(→‎{{header|Perl}}: perlcritic(isms): DON't (ab)use unpack @_ assignment to also create local vars! constrain var scope; use return keyword)
Line 1,157:
<lang perl>
sub insertion_sort {
my (@a, $i, $j, $klist) = @_;
forforeach my $i (1 .. $#alist) {
my $kj = $a[$i];
formy ($jk = $i; $j > 0 && $k < $alist[$j - 1i]; $j--) {
while ( $j > 0 && $a[$j]k =< $alist[$j - 1];) {
$list[$j] = $list[$j - 1];
$j--;
}
$alist[$j] = $k;
}
return @alist;
}
 
my @a = insertion_sort(4, 65, 2, -31, 0, 99, 83, 782, 1);
@a = insertion_sort @a;
print "@a\n";
</lang>
Anonymous user