排序——插入排序

package Sort

import (
	"fmt"
	"testing"
)

func InsertSort(array []int){
	if array == nil || len(array) < 2 {
		return
	}

	for  i := 1; i < len(array); i++ {
		for j := i - 1; j >= 0 && array[j] > array[j + 1]; j-- {
			Swap(array, j, j + 1)
		}
	}
}


func TestInsertSort(t *testing.T)  {
	arr := []int{230, 234, 43, 12, 2, 30,0, 23,230, 234, 43, 12, 2,30,0, 23}
	InsertSort(arr)
	fmt.Println(arr)
}