go实现一个快速排序

package main

import "fmt"

func quickSort(arr []int, left, right int) {

if left < right {
    pivot := partition(arr, left, right)
    quickSort(arr, left, pivot-1)
    quickSort(arr, pivot+1, right)
}

}

func partition(arr []int, left, right int) int {

pivot := arr[right]
i := left - 1
for j := left; j < right; j++ {
    if arr[j] < pivot {
        i++
        arr[i], arr[j] = arr[j], arr[i]
    }
}
arr[i+1], arr[right] = arr[right], arr[i+1]
return i + 1

}

func main() {

arr := []int{5, 2, 9, 1, 5, 6}
quickSort(arr, 0, len(arr)-1)
fmt.Pr
intln(arr)

}