go语言实现快速排序

package main

import "fmt"

func main()  {
    fmt.Println("快速排序")
    testArr := []int{23,12,34,6,8,342,234,8677,33,22,88}
    fmt.Println("排序前",testArr)
    quickSort(testArr,0,len(testArr) - 1)
    fmt.Println("排序后",testArr)
}

//快速排序
func quickSort(needSortArr []int,leftIndex int,rightIndex int){
    if leftIndex >= rightIndex {
        return
    }
    cutIndex := leftIndex
    for i := leftIndex + 1; i <= rightIndex; i++ {
        if needSortArr[leftIndex] >= needSortArr[i] {
            cutIndex++
            needSortArr[i], needSortArr[cutIndex] = needSortArr[cutIndex], needSortArr[i]
        }
    }
    needSortArr[leftIndex], needSortArr[cutIndex] = needSortArr[cutIndex], needSortArr[leftIndex]
    var wg sync.WaitGroup
    wg.Add(2)
    go func() {
        quickSort(needSortArr, leftIndex, cutIndex - 1)
        wg.Done()
    }()
    go func() {
        quickSort(needSortArr, cutIndex + 1, rightIndex)
        wg.Done()
    }()
    wg.Wait()
}