Initial data commit

Task/Sorting-algorithms-Comb-sort/Go/sorting-algorithms-comb-sort-1.go

@@ -0,0 +1,35 @@
+package main
+
+import "fmt"
+
+func main() {
+    a := []int{170, 45, 75, -90, -802, 24, 2, 66}
+    fmt.Println("before:", a)
+    combSort(a)
+    fmt.Println("after: ", a)
+}
+
+func combSort(a []int) {
+    if len(a) < 2 {
+        return
+    }
+    for gap := len(a); ; {
+        if gap > 1 {
+            gap = gap * 4 / 5
+        }
+        swapped := false
+        for i := 0; ; {
+            if a[i] > a[i+gap] {
+                a[i], a[i+gap] = a[i+gap], a[i]
+                swapped = true
+            }
+            i++
+            if i+gap >= len(a) {
+                break
+            }
+        }
+        if gap == 1 && !swapped {
+            break
+        }
+    }
+}

Task/Sorting-algorithms-Comb-sort/Go/sorting-algorithms-comb-sort-2.go

@@ -0,0 +1,38 @@
+package main
+
+import (
+  "sort"
+  "fmt"
+)
+
+func main() {
+    a := []int{170, 45, 75, -90, -802, 24, 2, 66}
+    fmt.Println("before:", a)
+    combSort(sort.IntSlice(a))
+    fmt.Println("after: ", a)
+}
+
+func combSort(a sort.Interface) {
+    if a.Len() < 2 {
+        return
+    }
+    for gap := a.Len(); ; {
+        if gap > 1 {
+            gap = gap * 4 / 5
+        }
+        swapped := false
+        for i := 0; ; {
+            if a.Less(i+gap, i) {
+                a.Swap(i, i+gap)
+                swapped = true
+            }
+            i++
+            if i+gap >= a.Len() {
+                break
+            }
+        }
+        if gap == 1 && !swapped {
+            break
+        }
+    }
+}