参考代码：

def Quick_Sort(list):
    if len(list)<2:
        return list
    else:
        mid_pivot = list[0]
        less_before_midpivot = [i for i in list[1:] if i<=mid_pivot]
        bigger_after_pivot = [i for i in list[1:] if i > mid_pivot]
        finally_list = Quick_Sort(less_before_midpivot)+[mid_pivot] + Quick_Sort(bigger_after_pivot)
        return finally_list

package main

import "fmt"

func sort(a []int) []int {
    aLen := len(a)
    for i := 0; i <= aLen; i++ {  // 冒泡排序
        for j := 1; j < aLen-i; j++ {
            if a[j] < a[j-1] {
                a[j], a[j-1] = a[j-1], a[j]
            }
        }
    }
    return a
}

func main() {
    /*
    对一个数组从小到大进行排序
     */

    a := []int{77,99,22,3,6,2,123,72}

    fmt.Println(sort(a))

}