一文学会Go - 2 数据结构与算法实践篇

func bubbleSort(array []int) {
    n := len(array)
    for j := 0; j < n; j++ {
        for i := 0; i < n-1-j; i++ {
            fmt.Println(i, j, n, array[i], array[i+1])
            if array[i] > array[i+1] {
                array[i], array[i+1] = array[i+1], array[i]
            }
        }
    }
}

func mergeSort(array []int) []int {
    n := len(array)
    if n <= 1 {
        return array
    }
    num := n / 2
    left := mergeSort(array[:num])
    right := mergeSort(array[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
}

package main

import "fmt"

func main() {
    src := []int{6, 202, 100, 301, 38, 8, 1}
    for _, e := range src {
        fmt.Print(e, ",")
    }
    fmt.Println()
    for _, e := range mergeSort(src) {
        fmt.Print(e, ",")
    }
    fmt.Println()
}