Skip to content

Commit

Permalink
Update base_sort_list.go
Browse files Browse the repository at this point in the history
  • Loading branch information
@kdgyun
kdgyun authored Jun 14, 2023
1 parent d13791c commit c02e6b2
Showing 1 changed file with 28 additions and 28 deletions.
56 changes: 28 additions & 28 deletions simplytest/base_sort_list.go
View file
Original file line number Diff line number Diff line change
Expand Up @@ -19,7 +19,7 @@ func CallBubbleSort(origin []int, verify []int, callName string) OutputForm {
if BUBBLE_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.BubbleSort(test)
end := time.Since(start)
Expand All @@ -33,7 +33,7 @@ func CallCocktailSort(origin []int, verify []int, callName string) OutputForm {
if COCKTAIL_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.CocktailSort(test)
end := time.Since(start)
Expand All @@ -47,7 +47,7 @@ func CallInsertionSort(origin []int, verify []int, callName string) OutputForm {
if INSERTION_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.InsertionSort(test)
end := time.Since(start)
Expand All @@ -61,7 +61,7 @@ func CallSelectionSort(origin []int, verify []int, callName string) OutputForm {
if SELECTION_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.SelectionSort(test)
end := time.Since(start)
Expand All @@ -75,7 +75,7 @@ func CallShellSort(origin []int, verify []int, callName string) OutputForm {
if SHELL_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.ShellSort(test)
end := time.Since(start)
Expand All @@ -89,7 +89,7 @@ func CallBottomUpMergeSort(origin []int, verify []int, callName string) OutputFo
if BOTTOM_UP_MERGE_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.BottomUpMergeSort(test)
end := time.Since(start)
Expand All @@ -103,7 +103,7 @@ func CallTopDownMergeSort(origin []int, verify []int, callName string) OutputFor
if TOP_DOWN_MERGE_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.TopDownMergeSort(test)
end := time.Since(start)
Expand All @@ -117,7 +117,7 @@ func CallParallelMergeSort(origin []int, verify []int, callName string) OutputFo
if PARALLEL_MERGE_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.ParallelMergeSort(test)
end := time.Since(start)
Expand All @@ -131,7 +131,7 @@ func CallHeapSort(origin []int, verify []int, callName string) OutputForm {
if HEAP_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.HeapSort(test)
end := time.Since(start)
Expand All @@ -145,7 +145,7 @@ func CallLPQuickSort(origin []int, verify []int, callName string) OutputForm {
if LEFT_PIVOT_QUICK_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.QuickSortLP(test)
end := time.Since(start)
Expand All @@ -159,7 +159,7 @@ func CallQuickSort(origin []int, verify []int, callName string) OutputForm {
if MIDDLE_PIVOT_QUICK_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.QuickSort(test)
end := time.Since(start)
Expand All @@ -173,7 +173,7 @@ func CallRPQuickSort(origin []int, verify []int, callName string) OutputForm {
if RIGHT_PIVOT_QUICK_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.QuickSortRP(test)
end := time.Since(start)
Expand All @@ -187,7 +187,7 @@ func CallParallelLPQuickSort(origin []int, verify []int, callName string) Output
if PARALLEL_LEFT_PIVOT_QUICK_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.ParallelQuickSortLP(test)
end := time.Since(start)
Expand All @@ -201,7 +201,7 @@ func CallParallelMPQuickSort(origin []int, verify []int, callName string) Output
if PARALLEL_MIDDLE_PIVOT_QUICK_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.ParallelQuickSort(test)
end := time.Since(start)
Expand All @@ -215,7 +215,7 @@ func CallParallelRPQuickSort(origin []int, verify []int, callName string) Output
if PARALLEL_RIGHT_PIVOT_QUICK_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.ParallelQuickSortRP(test)
end := time.Since(start)
Expand All @@ -229,7 +229,7 @@ func CallDualPivotQuickSort(origin []int, verify []int, callName string) OutputF
if DUAL_PIVOT_QUICK_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.DualPivotQuickSort(test)
end := time.Since(start)
Expand All @@ -243,7 +243,7 @@ func CallParallelDualPivotQuickSort(origin []int, verify []int, callName string)
if PARALLEL_DUAL_PIVOT_QUICK_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.ParallelDualPivotQuickSort(test)
end := time.Since(start)
Expand All @@ -257,7 +257,7 @@ func CallBinaryInsertionSort(origin []int, verify []int, callName string) Output
if BINARY_INSERTION_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.BinarySort(test)
end := time.Since(start)
Expand All @@ -271,7 +271,7 @@ func CallTimSort(origin []int, verify []int, callName string) OutputForm {
if TIM_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.TimSort(test)
end := time.Since(start)
Expand All @@ -285,7 +285,7 @@ func CallBitonicSort(origin []int, verify []int, callName string) OutputForm {
if BITONIC_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.BitonicSort(test)
end := time.Since(start)
Expand All @@ -299,7 +299,7 @@ func CallParallelBitonicSort(origin []int, verify []int, callName string) Output
if PARALLEL_BITONIC_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.ParallelBitonicSort(test)
end := time.Since(start)
Expand All @@ -313,7 +313,7 @@ func CallIntroSort(origin []int, verify []int, callName string) OutputForm {
if INTRO_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.IntroSort(test)
end := time.Since(start)
Expand All @@ -327,7 +327,7 @@ func CallParallelIntroSort(origin []int, verify []int, callName string) OutputFo
if PARALLEL_INTRO_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.ParallelIntroSort(test)
end := time.Since(start)
Expand All @@ -341,7 +341,7 @@ func CallCycleSort(origin []int, verify []int, callName string) OutputForm {
if CYCLE_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.CycleSort(test)
end := time.Since(start)
Expand All @@ -355,7 +355,7 @@ func CallOddEvenSort(origin []int, verify []int, callName string) OutputForm {
if ODDEVEN_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.OddEvenSort(test)
end := time.Since(start)
Expand All @@ -375,7 +375,7 @@ func CallOddEvenMergeSort(origin []int, verify []int, callName string) OutputFor
if ODDEVEN_MERGE_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.OddEvenMergeSort(test)
end := time.Since(start)
Expand All @@ -395,7 +395,7 @@ func CallParallelOddEvenMergeSort(origin []int, verify []int, callName string) O
if PARALLEL_ODDEVEN_MERGE_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.ParallelOddEvenMergeSort(test)
end := time.Since(start)
Expand All @@ -409,7 +409,7 @@ func CallCombSort(origin []int, verify []int, callName string) OutputForm {
if COMB_SORT {
test := make([]int, len(origin))
copy(test, origin)
fmt.Printf("runing %s...\n", callName)
fmt.Printf("running %s...\n", callName)
start := time.Now()
sorts.CombSort(test)
end := time.Since(start)
Expand Down

0 comments on commit c02e6b2

Please sign in to comment.