基本排序

冒泡排序

func BubbleSort(s []int64) []int64 {
	for i := len(s) - 1; i >= 0; i-- {
		for j := 0; j < i; j++ {
			if s[j] > s[j+1] {
				s[j], s[j+1] = s[j+1], s[j]
			}
		}
	}
	return s
}

选择排序

func SelectionSort(s []int64) []int64 {
	for i := 0; i < len(s); i++ {
		curMinIdx := i
		for j := i; j < len(s); j++ {
			if s[j] < s[curMinIdx] {
				curMinIdx = j
			}
		}
		s[i], s[curMinIdx] = s[curMinIdx], s[i]
	}
	return s
}

插入排序

func InsertionSort(s []int64) []int64 {
	for i := 0; i < len(s); i++ {
		for ; i > 0 && s[i-1] > s[i]; i-- {
			s[i-1], s[i] = s[i], s[i-1]
			fmt.Println(s)
		}
	}
	return s
}