3.7 go冒泡排序

package main

import (
	"fmt"
	"math/rand"
	"time"
)

func main() {

	rand.Seed(time.Now().UnixNano())
	var randArr [10]int
	for i := 0; i < len(randArr); i++ {

		randArr[i] = rand.Intn(100)
		//fmt.Println("rand=", rand.Intn(100)) //100以内的随机数
	}
	fmt.Println("排序前：", randArr)
	for i := 0; i < len(randArr)-1; i++ {
		for j := 0; j < len(randArr)-1-i; j++ {

			if randArr[j] > randArr[j+1] {
				randArr[j], randArr[j+1] = randArr[j+1], randArr[j]
			}
		}

	}

	fmt.Println("排序后：", randArr)
}