Merge pull request wangzheng0822#66 from liutianyi1989/master

11_sorts

Author: wangzheng0822

go/11_sorts/Sort.go

@@ -0,0 +1,54 @@
+package _1_sorts
+
+func BubbleSort(a []int) {
+arrLen := len(a)
+if arrLen <= 1 {
+return
+}
+for i := arrLen - 1; i > 0; i-- {
+for j := 0; j < i; j++ {
+if a[j] > a[j+1] {
+tmp := a[j+1]
+a[j+1] = a[j]
+a[j] = tmp
+}
+}
+}
+}
+
+func InsertSort(a []int) {
+arrLen := len(a)
+if arrLen <= 1 {
+return
+}
+for i := 1; i < arrLen; i++ {
+v := a[i]
+j := i - 1
+for ; j >= 0; j-- {
+if a[j] > v {
+a[j+1] = a[j]
+}
+}
+a[j+1] = v
+}
+}
+
+func SelectionSort(a []int) {
+arrLen := len(a)
+if arrLen <= 1 {
+return
+}
+for i := 0; i < arrLen; i++ {
+minIndex := i
+for j := i + 1; j < arrLen; j++ {
+if a[j] < a[minIndex] {
+minIndex = j
+}
+}
+if minIndex != i {
+tmp := a[minIndex]
+a[minIndex] = a[i]
+a[i] = tmp
+}
+}
+}

go/11_sorts/Sort_test.go

@@ -0,0 +1,43 @@
+package _1_sorts
+
+import (
+"testing"
+)
+
+func TestBubbleSort(t *testing.T) {
+a := []int{5, 4, 3, 2, 1}
+BubbleSort(a)
+t.Log(a)
+}
+
+func TestSelectionSort(t *testing.T) {
+a := []int{5, 4, 3, 2, 1}
+SelectionSort(a)
+t.Log(a)
+}
+func TestInsertSort(t *testing.T) {
+a := []int{5, 4, 3, 2, 1}
+InsertSort(a)
+t.Log(a)
+}
+
+func BenchmarkBubbleSort(b *testing.B) {
+a := []int{5, 4, 3, 2, 1}
+for i := 0; i < b.N; i++ {
+BubbleSort(a)
+}
+}
+
+func BenchmarkSelectionSort(b *testing.B) {
+a := []int{5, 4, 3, 2, 1}
+for i := 0; i < b.N; i++ {
+SelectionSort(a)
+}
+}
+
+func BenchmarkInsertSort(b *testing.B) {
+a := []int{5, 4, 3, 2, 1}
+for i := 0; i < b.N; i++ {
+InsertSort(a)
+}
+}