请golang写一段快速排序算法的代码

package main

import ( "fmt" )

func quickSort(arr []int) []int { if len(arr) <= 1 { return arr }

pivot := arr[0]
left := []int{}
right := []int{}

for _, v := range arr[1:] {
    if v < pivot {
        left = append(left, v)
    } else {
        right = append(right, v)
    }
}

left = quickSort(left