demo
package main
import "fmt"
func main() {
arr := [...]int{6, 8, 9, 5, 7, 3, 4, 2}
arr_len := len( arr )
fmt.Println( "冒泡排序之前:", arr )
for i := 0; i < arr_len ; i++ {
for j := i + 1; j < arr_len; j++ {
if arr[i] > arr[j] {
tem := arr[i]
arr[i] = arr[j]
arr[j] = tem
}
}
}
fmt.Println( "冒泡排序之后:", arr )
}
res
冒泡排序之前: [6 8 9 5 7 3 4 2]
冒泡排序之后: [2 3 4 5 6 7 8 9]