all tasks

Task/Sorting-algorithms-Comb-sort/D/sorting-algorithms-comb-sort.d

@@ -0,0 +1,22 @@
+import std.stdio, std.algorithm;
+
+void combSort(T)(T[] input) {
+    int gap = input.length;
+    bool swaps = true;
+
+    while (gap > 1 || swaps) {
+        gap = max(1, cast(int)(gap / 1.2473));
+        swaps = false;
+        foreach (i; 0 .. input.length - gap)
+            if (input[i] > input[i + gap]) {
+                swap(input[i], input[i + gap]);
+                swaps = true;
+            }
+    }
+}
+
+void main() {
+    auto array = [28, 44, 46, 24, 19, 2, 17, 11, 25, 4];
+    combSort(array);
+    writeln(array);
+}