Golang 冒泡排序 优化版

[code]package main

import "fmt"

func maopao(str []int)  {

lastexchange := 0
sortBorken := len(str)
for i:=0;i<len(str);i++ {
broken:=true
for j:=1;j<sortBorken;j++{
if str[j]<str[j-1] {
str[j],str[j-1] = str[j-1],str[j]
broken = false
lastexchange = j
}
}
sortBorken = lastexchange
if broken {
break
}
}
fmt.Println(str)
}

func main() {

a := make([]int,10)
a = []int{3,4,2,1,5,6,7,8}
maopao(a)
}