go语言学习-----冒泡排序和斐波数列fib

package main

import (
	"fmt"
	//"os"
	//"strings"
)

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

func fib(n int) []int {
	s := make([]int, n)
	s[0] = 1
	s[1] = 1

	for i := 2; i < n; i++ {
		s[i] = s[i-1] + s[i-2]
	}
	return s
}

func main() {
	f := fib(20)

	for _, value := range f {
		fmt.Println(value)
	}

	a := []int{3, 4, 1, 2, 6, 7, 9, 8, 5, 0}
	busort(a)
	fmt.Println(a)

}