用go实现简单的冒泡排序

package main 

import "fmt" 

func main(){
    var arr = [] int { 9 , 6 , 2 , 5 , 8 , 10 , 12 , 1 }
    var new_arr [] int
    new_arr = sortArr( arr , len( arr ) )
    fmt.Printf("%d ", new_arr)

}

func sortArr( arr [] int , size int) [] int {
    for i := 0 ; i < size ; i++ {
        for j := 0 ; j < ( size - 1 - i ) ; j++ {
            if arr[j] > arr[j+1] {
                tmp := arr[j+1]
                arr[j+1] = arr[j]
                arr[j] = tmp
            }
        }
    }
    return arr
}