Sorting algorithms/Comb sort: Difference between revisions
m
→{{header|Sidef}}: minor code simplification
(→{{header|uBasic/4tH}}: added zkl) |
m (→{{header|Sidef}}: minor code simplification) |
||
Line 1,972:
gap.div!(1.25).int! if (gap > 1);
swaps = false;
for i in ^(arr.len - gap)
if (arr[i] > arr[i+gap]) {
arr[i, i+gap] = arr[i+gap, i];
| |||