Sorting algorithms/Comb sort: Difference between revisions
m
→{{header|Sidef}}: minor code fix
m (→{{header|Sidef}}: minor code simplifications) |
m (→{{header|Sidef}}: minor code fix) |
||
Line 1,744:
gap.div!(1.25).int! if (gap > 1);
swaps = false;
(arr.
if (arr[i] > arr[i+gap]) {
arr[i, i+gap] = arr[i+gap, i];
|