请golang写一段快速排序算法的代码
时间: 2023-06-04 19:04:48 浏览: 30
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)
right = quickSort(right)
left = append(left, pivot)
return append(left, right...)
}
func main() {
arr := []int{3, 4, 1, 5, 9, 6, 2, 8, 7}
fmt.Println(quickSort(arr))
}