go语言种的常用排序方法
Go语言中常用的排序方法有以下几种:
- 冒泡排序(Bubble Sort)
func BubbleSort(arr []int) []int {n := len(arr)for i := 0; i < n-1; i++ {for j := 0; j < n-i-1; j++ {if arr[j] > arr[j+1] {arr[j], arr[j+1] = arr[j+1], arr[j]}}}return arr
}
- 插入排序(Insertion Sort)
func InsertionSort(arr []int) []int {n := len(arr)for i := 1; i < n; i++ {key := arr[i]j := i - 1for j >= 0 && arr[j] > key {arr[j+1] = arr[j]j--}arr[j+1] = key}return arr
}
- 选择排序(Selection Sort)
func SelectionSort(arr []int) []int {n := len(arr)for i := 0; i < n-1; i++ {minIndex := ifor j := i + 1; j < n; j++ {if arr[j] < arr[minIndex] {minIndex = j}}arr[i], arr[minIndex] = arr[minIndex], arr[i]}return arr
}
- 快速排序(Quick Sort)
func QuickSort(arr []int) []int {if len(arr) <= 1 {return arr}pivot := arr[0]var less, greater []intfor _, num := range arr[1:] {if num <= pivot {less = append(less, num)} else {greater = append(greater, num)}}var sorted []intsorted = append(sorted, QuickSort(less)...)sorted = append(sorted, pivot)sorted = append(sorted, QuickSort(greater)...)return sorted
}
以上是一些常用的排序方法,你可以根据需要选择适合的方法来对切片进行排序。