冒泡排序

冒泡排序的时间复杂度O(n^2)

package main

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

func bubbleSort(a []int)  {
	for i:=1; i<len(a); i++ {
		for j:=0; j<len(a)-i; j++ {
			if a[j]<a[j+1] {
				a[j],a[j+1]=a[j+1],a[j]
			}
		}
	}
}

func main()  {
	a:=make([]int,10)
	rand.Seed(time.Now().UnixNano())
	for i:=0; i<len(a); i++ {
		a[i]=rand.Intn(100)
	}
	fmt.Println(a)
	bubbleSort(a)
	fmt.Print(a)
}