Merge pull request #17 from fabiothiroki/insertion-sort

add insertion sort

sort/insertionsort/inserstionsort.go

@@ -0,0 +1,15 @@
+package insertionsort
+
+// InsertionSort:
+// Average/Worst Time: O(n^2) / Space: O(1)
+// Best: time O(n) space O(1)
+func InsertionSort(array []int) []int {
+
+	for i := range array {
+		for j := i; j > 0 && array[j-1] > array[j]; j-- {
+			array[j-1], array[j] = array[j], array[j-1]
+		}
+	}
+
+	return array
+}

sort/insertionsort/insertionsort_test.go

@@ -0,0 +1,14 @@
+package insertionsort
+
+import (
+	"reflect"
+	"testing"
+)
+
+func TestOne(t *testing.T) {
+	r := InsertionSort([]int{9, 8, 7, 6})
+
+	if !reflect.DeepEqual(r, []int{6, 7, 8, 9}) {
+		t.Errorf("Got: %v, want: %v.", r, []int{6, 7, 8, 9})
+	}
+}