Go语言如何提高快排的效率

package main
import "math/rand"
import "fmt"
import "time"
func quickSort(values []int,left,right int){
    temp:=values[left]
    p:=left
    i,j:=left,right
    for i<=j{
        for j>=p && values[j]>=temp{
            j--
        }
        if j>=p{
            values[p]=values[j]
            p=j
        }
        for i<=p && values[i]<=temp{
            i++
        }
        if i<=p{
            values[p]=values[i]
            p=i
        }
    }
    values[p]=temp
    if p-left>1{
        quickSort(values,left,p-1)
                //go quickSort(values,left,p-1)
    }
    if right-p>1{
        quickSort(values,p+1,right)
        //go quickSort(values,p+1,right)
    }
}
func QuickSort(values []int){
    quickSort(values,0,len(values)-1)
}
func main(){
        ceshi :=make([]int,10000)
        for i:=0 ; i<100; i++ {
                ceshi[i]=rand.Intn(100)
        }
        start_time :=time.Now()
        QuickSort(ceshi)
        end_time :=time.Since(start_time)
        fmt.Println("after sort",ceshi)
        fmt.Println("count time ",end_time)
}