package main
import (
"fmt"
)
//外排序之归并排序,归并排序最大特点是用了一个O(N)存储空间
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
}
func main() {
arr := []int{4, 1, 2, 9, 17, 5}
arr1 := mergeSort(arr)
fmt.Printf("main.arr:%v\n", arr1)
}
输出结果:
main.arr:[1 2 4 5 9 17]