isort

Documentation

Index

• func CopyArr(arr []int) []int
• func GenerateNearlyOrderedArray(n, swapTimes int) []int
• func GenerateRandomArray(n, min, max int) []int
• func InsertionSort(list []int) []int
• func IsSorted(arr []int) bool
• func MergeSort(list []int) []int
• func MergeSort_2(list []int) []int
• func QuickSort(list []int) []int
• func RandomInt(start, end int, includeEnd bool) int
• func TestSort(sortName string, f func([]int) []int, arr []int)
• func ThreeWayQuickSort(list []int) []int

Functions

func CopyArr

func CopyArr(arr []int) []int

func GenerateNearlyOrderedArray

func GenerateNearlyOrderedArray(n, swapTimes int) []int

func GenerateRandomArray

func GenerateRandomArray(n, min, max int) []int

func InsertionSort

func InsertionSort(list []int) []int

* InsertionSort: 插入排序 前置的元素已经排好序, 每次从最后一个排好序的元素的下一位开始, 往前比较, 将元素插入相应的位置

func IsSorted

func IsSorted(arr []int) bool

func MergeSort

func MergeSort(list []int) []int

func MergeSort_2

func MergeSort_2(list []int) []int

func QuickSort

func QuickSort(list []int) []int

* QuickSort: 每次找一个标定点(随机下标), 将数组划分为两部分, 左边<=标点定, 右边>=标定点 然后再对标定点的两侧分别进行相同的操作

func RandomInt

func RandomInt(start, end int, includeEnd bool) int

randomInt, [start, end]/ [start, end)

func TestSort

func TestSort(sortName string, f func([]int) []int, arr []int)

func ThreeWayQuickSort

func ThreeWayQuickSort(list []int) []int