package main
import "fmt"
func main() {
A := []int{3, 6, 9, 7, 8, 4, 2, 10}
fmt.Println(A)
InsertSort(A)
fmt.Println(A)
}
func InsertSort(A []int) {
for i := 1; i < len(A); i++ {
x := A[i]
j := i - 1
for j >= 0 && A[j] > x {
A[j+1] = A[j]
j--
}
A[j+1] = x
}
}