Sorting algorithms/Comb sort: Difference between revisions

m
→‎{{header|Sidef}}: minor code simplifications
(→‎{{header|REXX}}: added/changed whitespace and comments.)
m (→‎{{header|Sidef}}: minor code simplifications)
Line 1,738:
 
=={{header|Sidef}}==
<lang ruby>func combSortcomb_sort(arr is Array) {
var gap = arr.len;
var swaps = true;
while (gap > 1 || swaps) {
{gap.div!(1.25).int!} if (gap > 1);
swaps = false;
0 to (arr.end - gap) -> .range.each { |i|
if (arr[i] > arr[i+gap]) {
arr[i, i+gap] = arr[i+gap, i];
Line 1,750:
}
}
};
return arr;
};</lang>
 
=={{header|Swift}}==
2,747

edits