Add insertion sort with less loops

aud/insertionsort.go

@@ -35,4 +35,18 @@ func InsertionSort(list []int) []int {
     }
 
     return list
+
+}
+
+func TheOtherInsertionSort(list []int) []int {
+	for round := 1; round < len(list); round++ {
+		element_to_insert := list[round]
+		pos := round
+		for pos > 0 && element_to_insert < list[pos-1] {
+			list[pos] = list[pos-1]
+			pos--
+		}
+		list[pos] = element_to_insert
+	}
+	return list
 }