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