Simple and custom insertion sort in Go (GoLang).

insertionsort.go

package slice

// For learning purpose only.
// Please, use the sort package of Go's Standard library: https://pkg.go.dev/sort

// InsertionSort sorts the slice `vals` with the
// insertion sort algorithm.
// Time: O(n^2)
// Space: O(1)
func InsertionSort(vals []int) {
	for i := 1; i < len(vals); i++ {
		for j := i; j > 0 && vals[j-1] > vals[j]; j-- {
			vals[j-1], vals[j] = vals[j], vals[j-1]
		}
	}
}