golang实现桶排序

package main
import "fmt"
//实现排序排序func quickSort(nums []int, start, end int) []int {  if start < end {    i, j := start, end    key := nums[(start+end)/2]    for i <= j {      for nums[i] < key {        i++      }      for nums[j] > key {        j--      }      if i <= j {        nums[i], nums[j] = nums[j], nums[i]        i++        j--      }    }    if start < j {      nums = quickSort(nums, start, j)    }    if end > i {      nums = quickSort(nums, i, end)    }
  }  return nums}
func bucketSort(nums []int, bucketNum int) []int {  bucket := [][]int{}  for i := 0; i < bucketNum; i++ {    tmp := make([]int, 1)    bucket = append(bucket, tmp)  }
  //将数据分配到桶中  for i := 0; i < len(nums); i++ {    bucket[nums[i]/bucketNum] = append(bucket[nums[i]/bucketNum], nums[i])  }
  //循环所有的桶进行排序  index := 0  for i := 0; i < bucketNum; i++ {    if len(bucket[i]) > 1 {      //对每个桶内部进行排序,使用快排      bucket[i] = quickSort(bucket[i], 0, len(bucket[i])-1)      for j := 1; j < len(bucket[i]); j++ { //去掉一开始的tmp        nums[index] = bucket[i][j]        index++      }    }  }  return nums}
func main() {  nums := []int{45, 63, 3, 1, 29, 77, 20, 4, 30}  fmt.Println("排序前：")  fmt.Println(nums)  nums = bucketSort(nums, 20)  fmt.Println("排序后：")  fmt.Println(nums)}

排序前：[45 63 3 1 29 77 20 4 30]排序后：[1 3 4 20 29 30 45 63 77]