Go初接触之归并排序

　　刚开始接触go语言，有些不适应，整体和C有些相像，所以学起来也不太困难，但是刚接触也感觉到了go在很多方面的强大。掌握了go的基本语法，简单写个归并排序练习一下：

package main

import (
    "fmt"
)

func hebing(arr []int8, left int8, mid int8, right int8) {
    var arr2 [10]int8
    i, j := left, mid + 1
    cnt := 0
    for i <= mid && j <= right {
        if arr[i] < arr[j] {
            arr2[cnt] = arr[i]
            cnt += 1
            i += 1
        } else {
            arr2[cnt] = arr[j]
            cnt += 1
            j += 1
        }
    }
    for i <= mid {
        arr2[cnt] = arr[i]
        cnt += 1
        i += 1
    }
    for j <= right {
        arr2[cnt] = arr[j]
        cnt += 1
        j += 1
    }
    for tm1, tm2 := 0, left; tm2 <= right; tm1, tm2 = tm1 + 1, tm2 + 1 {
        arr[tm2] = arr2[tm1]
    }
}

func mergesort(arr []int8, left int8, right int8) {
    if left >= right {
        return
    }
    mid := (left + right) / 2
    fmt.Println(left, mid, right)
    mergesort(arr, left, mid)
    mergesort(arr, mid + 1, right)
    hebing(arr, left, mid, right)
}

func main() {
    var arr = []int8{1, 4, 2, 5, 3}
    mergesort(arr, 0, 4)
    fmt.Println(arr)    
}