Sorting algorithms/Comb sort: Difference between revisions

Content added Content deleted

Inline

@@ Line 1,972: / Line 1,972: @@
         gap.div!(1.25).int! if (gap > 1);
         swaps = false;
-        (arr.len - gap).range.each { |i|
+        for i in ^(arr.len - gap) {
             if (arr[i] > arr[i+gap]) {
                 arr[i, i+gap] = arr[i+gap, i];