Anonymous user
Sorting algorithms/Comb sort: Difference between revisions
added perl
(→{{header|Icon}}: brief) |
(added perl) |
||
Line 577:
{CombSort Arr}
{Show {Array.toRecord unit Arr}}</lang>
=={{header|Perl}}==
<lang perl>sub combSort {
my @arr = @_;
my $gap = @arr;
my $swaps = 1;
while ($gap > 1 || $swaps) {
$gap /= 1.25 if $gap > 1;
$swaps = 0;
foreach my $i (0 .. $#arr - $gap) {
if ($arr[$i] > $arr[$i+$gap]) {
@arr[$i, $i+$gap] = @arr[$i+$gap, $i];
$swaps = 1;
}
}
}
return @arr;
}</lang>
=={{header|PHP}}==
<lang php>function combSort($arr){
$gap = count($arr);
$swap = true;
while ($gap > 1 || $swap){
if($gap > 1) $gap /= 1.25;
| |||