Go语言版冒泡排序

为什么80%的码农都做不了架构师？>>>   

 

package main

import (
	"fmt"
)

func main() {
	a := [...]int{1, 3, 7, 4, 5, 6, 8}
	fmt.Println(a)
	var num int
	num = len(a)
	for i := 0; i < num; i++ {
		for j := i + 1; j < num-1; j++ {
			if a[i] > a[j] {
				temp := a[i]
				a[i] = a[j]
				a[j] = temp
			}
		}
	}
	fmt.Println(a)
}

或者

package main

import (
	"fmt"
)

func main() {
	a := [...]int{1, 3, 7, 4, 5, 6, 8}
	fmt.Println(a)
	var num int
	num = len(a)
	for i := 1; i < num; i++ {
		for j := 0; j < num-i; j++ {
			if a[j] > a[j+1] {
				temp := a[j]
				a[j] = a[j+1]
				a[j+1] = temp
			}
		}
	}
	fmt.Println(a)
}

 

转载于:https://my.oschina.net/itfanr/blog/195657