Go Insertion Sort

package main

import ("fmt"
        "math/rand"
        "time")

const ARLEN int = 10

func randomArray() [ARLEN]int {
    seed := rand.NewSource(time.Now().UnixNano())
    rnd := rand.New(seed)
    var arr [ARLEN]int
    for i:=0; i<ARLEN; i++ {
        arr[i] = rnd.Intn(100)
    }
    return arr
}

func swap(arr *[ARLEN]int, a, b int) {
    temp := arr[a]
    arr[a] = arr[b]
    arr[b] = temp
}

func insertionSort(arr *[ARLEN]int) {
    for i:=1; i<ARLEN; i++ {
        toSort := arr[i]
        k:=i
        for ;k>0 && arr[k-1] > toSort ; k--{
            swap(arr, k, k-1)
        }
        arr[k] = toSort
    }
}

func main() {
    arr := randomArray()
    fmt.Println("generated random Array:", arr)

    insertionSort(&arr)
    fmt.Println("Insertionsorted Array:", arr)
}