package algorithm
func InsertSort(arr []int, n int) {
for i := 1; i < n; i++ {
x := arr[i]
j := i - 1
for j >= 0 && arr[j] > x {
arr[j+1] = arr[j]
j--
}
arr[j+1] = x
}
}