func mergeSort(r []int) []int {
length := len(r)
if length <= 1 {
return r
}
num := length / 2
left := mergeSort(r[:num])
right := mergeSort(r[num:])
return merge(left, right)
}
func merge(left, right []int) (result []int) {
l, r := 0, 0
for l < len(left) && r < len(right) {
if left[l] < right[r] {
result = append(result, left[l])
l++
} else {
result = append(result, right[r])
r++
}
}
result = append(result, left[l:]...)
result = append(result, right[r:]...)
return
}
评论列表(3条)
我是博大号的签约作者“admin”
本文概览:func mergeSort(r []int) []int { length := len(r) if length <= 1 { ret...
文章不错《为什么OGP影像测量仪器编程时数据输出到电脑桌面时自动打印-》内容很有帮助