1

2

3

4

5

6

7

8

9

10

11

12

13

14

15

16

17

18

19

20

21

22

23

package main

import "fmt"

func main() {

    arrays := []int{6, 2, 5, 8, 9, 3, 1}

    length := len(arrays)

    insertionSort(arrays, length)

    for i := 0; i < length; i++ {

        fmt.Printf("%d ", arrays[i])

    }

}

func insertionSort(unsorted []int, length int) {

    for i := 0; i < length; i++ {

        var insertElement = unsorted[i]

        var insertPosition = i

        for j := insertPosition - 1; j >= 0; j-- {

            if insertElement < unsorted[j] {

                unsorted[j+1] = unsorted[j]

                insertPosition--

            }

        }

        unsorted[insertPosition] = insertElement

    }

}