帮我使用golang写一段快速排序的代码。
时间: 2023-03-14 09:11:10 浏览: 79
package main import "fmt"func QuickSort(arr []int) []int {
if len(arr) < 2 {
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) return append(append(left, pivot), right...)
}func main() {
arr := []int{9, 8, 7, 6, 5, 4, 3, 2, 1}
fmt.Println(QuickSort(arr))
}我用Go语言给你写了一段快速排序的代码:package main import "fmt"func QuickSort(arr []int) []int {
if len(arr) < 2 {
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) return append(append(left, pivot), right...)
}func main() {
arr := []int{9, 8, 7, 6, 5, 4, 3, 2, 1}
fmt.Println(QuickSort(arr))
}