all tasks

Task/Sorting-algorithms-Insertion-sort/Go/sorting-algorithms-insertion-sort-1.go

@@ -0,0 +1,23 @@
+package main
+
+import "fmt"
+
+func insertionSort(a []int) {
+    for i := 1; i < len(a); i++ {
+        value := a[i]
+        j := i - 1
+        for j >= 0 && a[j] > value {
+            a[j+1] = a[j]
+            j = j - 1
+        }
+        a[j+1] = value
+    }
+}
+
+func main() {
+    list := []int{31, 41, 59, 26, 53, 58, 97, 93, 23, 84}
+    fmt.Println("unsorted:", list)
+
+    insertionSort(list)
+    fmt.Println("sorted!  ", list)
+}

Task/Sorting-algorithms-Insertion-sort/Go/sorting-algorithms-insertion-sort-2.go

@@ -0,0 +1,22 @@
+package main
+
+import (
+  "fmt"
+  "sort"
+)
+
+func insertionSort(a sort.Interface) {
+    for i := 1; i < a.Len(); i++ {
+        for j := i; j > 0 && a.Less(j, j-1); j-- {
+            a.Swap(j-1, j)
+        }
+    }
+}
+
+func main() {
+    list := []int{31, 41, 59, 26, 53, 58, 97, 93, 23, 84}
+    fmt.Println("unsorted:", list)
+
+    insertionSort(sort.IntSlice(list))
+    fmt.Println("sorted!  ", list)
+}

Task/Sorting-algorithms-Insertion-sort/Go/sorting-algorithms-insertion-sort-3.go

@@ -0,0 +1,23 @@
+package main
+
+import (
+  "fmt"
+  "sort"
+)
+
+func insertionSort(a []int) {
+    for i := 1; i < len(a); i++ {
+        value := a[i]
+        j := sort.Search(i, func(k int) bool { return a[k] > value })
+        copy(a[j+1:i+1], a[j:i])
+        a[j] = value
+    }
+}
+
+func main() {
+    list := []int{31, 41, 59, 26, 53, 58, 97, 93, 23, 84}
+    fmt.Println("unsorted:", list)
+
+    insertionSort(list)
+    fmt.Println("sorted!  ", list)
+}