Anonymous user
Sorting algorithms/Comb sort: Difference between revisions
no edit summary
m (Added Io version.) |
No edit summary |
||
Line 238:
{CombSort Arr}
{Show {Array.toRecord unit Arr}}</lang>
=={{header|PHP}}==
<lang php>function combSort($arr){
$gap = count($arr);
while ($gap > 1 || $swap){
if($gap > 1) $gap /= 1.25;
$swap = false;
$i = 0;
while($i+$gap < count($arr)){
if($arr[$i] > $arr[$i+$gap]){
list($arr[$i], $arr[$i+$gap]) = array($arr[$i+$gap],$arr[$i]);
$swap = true;
}
$i++;
}
}
return $arr;
}</lang>
=={{header|PL/I}}==
<lang PL/I>
| |||