Sorts implemented in go

quiksort_lomuto.go

func QuickSort(a []int32) []int32 {
    if len(a) < 2 {
        return a
    }

    // lomuto partition
    lastIndex := len(a) - 1
    pivot := a[lastIndex]    
    j := -1
    for i := range a[:lastIndex] {
        if a[i] <= pivot {
            j++
            v1, v2 := a[i], a[j]
            a[i], a[j] = v2, v1
        }
    }
    j++
    v1, v2 := a[lastIndex], a[j]
    a[len(a)-1], a[j] = v2, v1

    QuickSort(a[:j])
    QuickSort(a[j:])
    return a
}