rename

Author: howz97

demo/sort.go

@@ -8,6 +8,6 @@ import (
 
 func main() {
 	sli := []int{46, 4, 1, 26, 4, 25}
-	sort.QuickSort(sli)
+	sort.Quick(sli)
 	fmt.Println(sli)
 }

graphs/digraph_test.go

@@ -124,7 +124,7 @@ func TestDFS_Digraph(t *testing.T) {
 func checkDFSResults(t *testing.T, g *Digraph, dfsResults [][]int) {
 	for src := range dfsResults {
 		reach := g.ReachableSlice(src)
-		sort.QuickSort(stdsort.IntSlice(reach))
+		sort.Quick(stdsort.IntSlice(reach))
 		if !util.SliceEqual(reach, dfsResults[src]) {
 			t.Errorf("v %d reach %v not equal %v", src, reach, dfsResults[src])
 		}

sort/pop_sort.go renamed to sort/bubble.go

@@ -2,7 +2,7 @@ package sort
 
 import "golang.org/x/exp/constraints"
 
-func PopSort[Ord constraints.Ordered](data []Ord) {
+func Bubble[Ord constraints.Ordered](data []Ord) {
 	for i := len(data) - 1; i > 0; i-- {
 		for j := 0; j < i; j++ {
 			if data[j] > data[j+1] {

sort/heap_sort.go renamed to sort/heap.go

@@ -2,7 +2,7 @@ package sort
 
 import "golang.org/x/exp/constraints"
 
-func HeapSort[Ord constraints.Ordered](data []Ord) {
+func Heap[Ord constraints.Ordered](data []Ord) {
 	adjust(data)
 	for i := len(data) - 1; i > 0; i-- {
 		data[0], data[i] = data[i], data[0]

sort/insert_sort.go renamed to sort/insert.go

@@ -2,8 +2,7 @@ package sort
 
 import "golang.org/x/exp/constraints"
 
-// InsertSort -
-func InsertSort[Ord constraints.Ordered](data []Ord) {
+func Insert[Ord constraints.Ordered](data []Ord) {
 	for i := 1; i < len(data); i++ {
 		insrtNum := data[i]
 		j := i - 1

sort/merge_sort.go renamed to sort/merge.go

@@ -2,7 +2,7 @@ package sort
 
 import "golang.org/x/exp/constraints"
 
-func MergeSort[Ord constraints.Ordered](data []Ord) {
+func Merge[Ord constraints.Ordered](data []Ord) {
 	aux := make([]Ord, len(data))
 	mergeSort(data, aux)
 }

sort/quick_sort.go renamed to sort/quick.go

@@ -2,7 +2,7 @@ package sort
 
 import "golang.org/x/exp/constraints"
 
-func QuickSort[Ord constraints.Ordered](data []Ord) {
+func Quick[Ord constraints.Ordered](data []Ord) {
 	quickSort(data, 0, len(data)-1)
 }
 

sort/select_sort.go renamed to sort/select.go

@@ -2,7 +2,7 @@ package sort
 
 import "golang.org/x/exp/constraints"
 
-func SelectSort[Ord constraints.Ordered](data []Ord) {
+func Select[Ord constraints.Ordered](data []Ord) {
 	for i := 0; i < len(data)-1; i++ {
 		idxMin := i
 		for j := i + 1; j < len(data); j++ {

sort/shell_sort.go renamed to sort/shell.go

@@ -2,7 +2,7 @@ package sort
 
 import "golang.org/x/exp/constraints"
 
-func ShellSort[Ord constraints.Ordered](data []Ord) {
+func Shell[Ord constraints.Ordered](data []Ord) {
 	// 使用希尔增量
 	for incre := len(data) >> 1; incre > 1; incre >>= 1 {
 		for i := incre; i < len(data); i++ {
@@ -14,7 +14,7 @@ func ShellSort[Ord constraints.Ordered](data []Ord) {
 			data[j+incre] = insrtNum
 		}
 	}
-	InsertSort(data)
+	Insert(data)
 }
 
 //func ShellSort(data []int) {

sort/sort_test.go

@@ -9,13 +9,13 @@ import (
 )
 
 func TestContrast(t *testing.T) {
-	testPerformance(PopSort[int], "PopSort")
-	testPerformance(SelectSort[int], "SelectSort")
-	testPerformance(InsertSort[int], "InsertSort")
-	testPerformance(ShellSort[int], "ShellSort")
-	testPerformance(MergeSort[int], "MergeSort")
-	testPerformance(HeapSort[int], "HeapSort")
-	testPerformance(QuickSort[int], "QuickSort")
+	testPerformance(Bubble[int], "PopSort")
+	testPerformance(Select[int], "SelectSort")
+	testPerformance(Insert[int], "InsertSort")
+	testPerformance(Shell[int], "ShellSort")
+	testPerformance(Merge[int], "MergeSort")
+	testPerformance(Heap[int], "HeapSort")
+	testPerformance(Quick[int], "QuickSort")
 
 	testPerformance(func(p []int) { stdsort.Sort(stdsort.IntSlice(p)) }, "Go library sort.Ints")
 }