Skip to content

Commit c02e6b2

Browse files
kdgyunkdgyun
authored
Update base_sort_list.go
1 parent d13791c commit c02e6b2

File tree

1 file changed

+28
-28
lines changed

1 file changed

+28
-28
lines changed

‎simplytest/base_sort_list.go‎

Lines changed: 28 additions & 28 deletions
Original file line numberDiff line numberDiff line change
@@ -19,7 +19,7 @@ func CallBubbleSort(origin []int, verify []int, callName string) OutputForm {
1919
if BUBBLE_SORT {
2020
test := make([]int, len(origin))
2121
copy(test, origin)
22-
fmt.Printf("runing %s...\n", callName)
22+
fmt.Printf("running %s...\n", callName)
2323
start := time.Now()
2424
sorts.BubbleSort(test)
2525
end := time.Since(start)
@@ -33,7 +33,7 @@ func CallCocktailSort(origin []int, verify []int, callName string) OutputForm {
3333
if COCKTAIL_SORT {
3434
test := make([]int, len(origin))
3535
copy(test, origin)
36-
fmt.Printf("runing %s...\n", callName)
36+
fmt.Printf("running %s...\n", callName)
3737
start := time.Now()
3838
sorts.CocktailSort(test)
3939
end := time.Since(start)
@@ -47,7 +47,7 @@ func CallInsertionSort(origin []int, verify []int, callName string) OutputForm {
4747
if INSERTION_SORT {
4848
test := make([]int, len(origin))
4949
copy(test, origin)
50-
fmt.Printf("runing %s...\n", callName)
50+
fmt.Printf("running %s...\n", callName)
5151
start := time.Now()
5252
sorts.InsertionSort(test)
5353
end := time.Since(start)
@@ -61,7 +61,7 @@ func CallSelectionSort(origin []int, verify []int, callName string) OutputForm {
6161
if SELECTION_SORT {
6262
test := make([]int, len(origin))
6363
copy(test, origin)
64-
fmt.Printf("runing %s...\n", callName)
64+
fmt.Printf("running %s...\n", callName)
6565
start := time.Now()
6666
sorts.SelectionSort(test)
6767
end := time.Since(start)
@@ -75,7 +75,7 @@ func CallShellSort(origin []int, verify []int, callName string) OutputForm {
7575
if SHELL_SORT {
7676
test := make([]int, len(origin))
7777
copy(test, origin)
78-
fmt.Printf("runing %s...\n", callName)
78+
fmt.Printf("running %s...\n", callName)
7979
start := time.Now()
8080
sorts.ShellSort(test)
8181
end := time.Since(start)
@@ -89,7 +89,7 @@ func CallBottomUpMergeSort(origin []int, verify []int, callName string) OutputFo
8989
if BOTTOM_UP_MERGE_SORT {
9090
test := make([]int, len(origin))
9191
copy(test, origin)
92-
fmt.Printf("runing %s...\n", callName)
92+
fmt.Printf("running %s...\n", callName)
9393
start := time.Now()
9494
sorts.BottomUpMergeSort(test)
9595
end := time.Since(start)
@@ -103,7 +103,7 @@ func CallTopDownMergeSort(origin []int, verify []int, callName string) OutputFor
103103
if TOP_DOWN_MERGE_SORT {
104104
test := make([]int, len(origin))
105105
copy(test, origin)
106-
fmt.Printf("runing %s...\n", callName)
106+
fmt.Printf("running %s...\n", callName)
107107
start := time.Now()
108108
sorts.TopDownMergeSort(test)
109109
end := time.Since(start)
@@ -117,7 +117,7 @@ func CallParallelMergeSort(origin []int, verify []int, callName string) OutputFo
117117
if PARALLEL_MERGE_SORT {
118118
test := make([]int, len(origin))
119119
copy(test, origin)
120-
fmt.Printf("runing %s...\n", callName)
120+
fmt.Printf("running %s...\n", callName)
121121
start := time.Now()
122122
sorts.ParallelMergeSort(test)
123123
end := time.Since(start)
@@ -131,7 +131,7 @@ func CallHeapSort(origin []int, verify []int, callName string) OutputForm {
131131
if HEAP_SORT {
132132
test := make([]int, len(origin))
133133
copy(test, origin)
134-
fmt.Printf("runing %s...\n", callName)
134+
fmt.Printf("running %s...\n", callName)
135135
start := time.Now()
136136
sorts.HeapSort(test)
137137
end := time.Since(start)
@@ -145,7 +145,7 @@ func CallLPQuickSort(origin []int, verify []int, callName string) OutputForm {
145145
if LEFT_PIVOT_QUICK_SORT {
146146
test := make([]int, len(origin))
147147
copy(test, origin)
148-
fmt.Printf("runing %s...\n", callName)
148+
fmt.Printf("running %s...\n", callName)
149149
start := time.Now()
150150
sorts.QuickSortLP(test)
151151
end := time.Since(start)
@@ -159,7 +159,7 @@ func CallQuickSort(origin []int, verify []int, callName string) OutputForm {
159159
if MIDDLE_PIVOT_QUICK_SORT {
160160
test := make([]int, len(origin))
161161
copy(test, origin)
162-
fmt.Printf("runing %s...\n", callName)
162+
fmt.Printf("running %s...\n", callName)
163163
start := time.Now()
164164
sorts.QuickSort(test)
165165
end := time.Since(start)
@@ -173,7 +173,7 @@ func CallRPQuickSort(origin []int, verify []int, callName string) OutputForm {
173173
if RIGHT_PIVOT_QUICK_SORT {
174174
test := make([]int, len(origin))
175175
copy(test, origin)
176-
fmt.Printf("runing %s...\n", callName)
176+
fmt.Printf("running %s...\n", callName)
177177
start := time.Now()
178178
sorts.QuickSortRP(test)
179179
end := time.Since(start)
@@ -187,7 +187,7 @@ func CallParallelLPQuickSort(origin []int, verify []int, callName string) Output
187187
if PARALLEL_LEFT_PIVOT_QUICK_SORT {
188188
test := make([]int, len(origin))
189189
copy(test, origin)
190-
fmt.Printf("runing %s...\n", callName)
190+
fmt.Printf("running %s...\n", callName)
191191
start := time.Now()
192192
sorts.ParallelQuickSortLP(test)
193193
end := time.Since(start)
@@ -201,7 +201,7 @@ func CallParallelMPQuickSort(origin []int, verify []int, callName string) Output
201201
if PARALLEL_MIDDLE_PIVOT_QUICK_SORT {
202202
test := make([]int, len(origin))
203203
copy(test, origin)
204-
fmt.Printf("runing %s...\n", callName)
204+
fmt.Printf("running %s...\n", callName)
205205
start := time.Now()
206206
sorts.ParallelQuickSort(test)
207207
end := time.Since(start)
@@ -215,7 +215,7 @@ func CallParallelRPQuickSort(origin []int, verify []int, callName string) Output
215215
if PARALLEL_RIGHT_PIVOT_QUICK_SORT {
216216
test := make([]int, len(origin))
217217
copy(test, origin)
218-
fmt.Printf("runing %s...\n", callName)
218+
fmt.Printf("running %s...\n", callName)
219219
start := time.Now()
220220
sorts.ParallelQuickSortRP(test)
221221
end := time.Since(start)
@@ -229,7 +229,7 @@ func CallDualPivotQuickSort(origin []int, verify []int, callName string) OutputF
229229
if DUAL_PIVOT_QUICK_SORT {
230230
test := make([]int, len(origin))
231231
copy(test, origin)
232-
fmt.Printf("runing %s...\n", callName)
232+
fmt.Printf("running %s...\n", callName)
233233
start := time.Now()
234234
sorts.DualPivotQuickSort(test)
235235
end := time.Since(start)
@@ -243,7 +243,7 @@ func CallParallelDualPivotQuickSort(origin []int, verify []int, callName string)
243243
if PARALLEL_DUAL_PIVOT_QUICK_SORT {
244244
test := make([]int, len(origin))
245245
copy(test, origin)
246-
fmt.Printf("runing %s...\n", callName)
246+
fmt.Printf("running %s...\n", callName)
247247
start := time.Now()
248248
sorts.ParallelDualPivotQuickSort(test)
249249
end := time.Since(start)
@@ -257,7 +257,7 @@ func CallBinaryInsertionSort(origin []int, verify []int, callName string) Output
257257
if BINARY_INSERTION_SORT {
258258
test := make([]int, len(origin))
259259
copy(test, origin)
260-
fmt.Printf("runing %s...\n", callName)
260+
fmt.Printf("running %s...\n", callName)
261261
start := time.Now()
262262
sorts.BinarySort(test)
263263
end := time.Since(start)
@@ -271,7 +271,7 @@ func CallTimSort(origin []int, verify []int, callName string) OutputForm {
271271
if TIM_SORT {
272272
test := make([]int, len(origin))
273273
copy(test, origin)
274-
fmt.Printf("runing %s...\n", callName)
274+
fmt.Printf("running %s...\n", callName)
275275
start := time.Now()
276276
sorts.TimSort(test)
277277
end := time.Since(start)
@@ -285,7 +285,7 @@ func CallBitonicSort(origin []int, verify []int, callName string) OutputForm {
285285
if BITONIC_SORT {
286286
test := make([]int, len(origin))
287287
copy(test, origin)
288-
fmt.Printf("runing %s...\n", callName)
288+
fmt.Printf("running %s...\n", callName)
289289
start := time.Now()
290290
sorts.BitonicSort(test)
291291
end := time.Since(start)
@@ -299,7 +299,7 @@ func CallParallelBitonicSort(origin []int, verify []int, callName string) Output
299299
if PARALLEL_BITONIC_SORT {
300300
test := make([]int, len(origin))
301301
copy(test, origin)
302-
fmt.Printf("runing %s...\n", callName)
302+
fmt.Printf("running %s...\n", callName)
303303
start := time.Now()
304304
sorts.ParallelBitonicSort(test)
305305
end := time.Since(start)
@@ -313,7 +313,7 @@ func CallIntroSort(origin []int, verify []int, callName string) OutputForm {
313313
if INTRO_SORT {
314314
test := make([]int, len(origin))
315315
copy(test, origin)
316-
fmt.Printf("runing %s...\n", callName)
316+
fmt.Printf("running %s...\n", callName)
317317
start := time.Now()
318318
sorts.IntroSort(test)
319319
end := time.Since(start)
@@ -327,7 +327,7 @@ func CallParallelIntroSort(origin []int, verify []int, callName string) OutputFo
327327
if PARALLEL_INTRO_SORT {
328328
test := make([]int, len(origin))
329329
copy(test, origin)
330-
fmt.Printf("runing %s...\n", callName)
330+
fmt.Printf("running %s...\n", callName)
331331
start := time.Now()
332332
sorts.ParallelIntroSort(test)
333333
end := time.Since(start)
@@ -341,7 +341,7 @@ func CallCycleSort(origin []int, verify []int, callName string) OutputForm {
341341
if CYCLE_SORT {
342342
test := make([]int, len(origin))
343343
copy(test, origin)
344-
fmt.Printf("runing %s...\n", callName)
344+
fmt.Printf("running %s...\n", callName)
345345
start := time.Now()
346346
sorts.CycleSort(test)
347347
end := time.Since(start)
@@ -355,7 +355,7 @@ func CallOddEvenSort(origin []int, verify []int, callName string) OutputForm {
355355
if ODDEVEN_SORT {
356356
test := make([]int, len(origin))
357357
copy(test, origin)
358-
fmt.Printf("runing %s...\n", callName)
358+
fmt.Printf("running %s...\n", callName)
359359
start := time.Now()
360360
sorts.OddEvenSort(test)
361361
end := time.Since(start)
@@ -375,7 +375,7 @@ func CallOddEvenMergeSort(origin []int, verify []int, callName string) OutputFor
375375
if ODDEVEN_MERGE_SORT {
376376
test := make([]int, len(origin))
377377
copy(test, origin)
378-
fmt.Printf("runing %s...\n", callName)
378+
fmt.Printf("running %s...\n", callName)
379379
start := time.Now()
380380
sorts.OddEvenMergeSort(test)
381381
end := time.Since(start)
@@ -395,7 +395,7 @@ func CallParallelOddEvenMergeSort(origin []int, verify []int, callName string) O
395395
if PARALLEL_ODDEVEN_MERGE_SORT {
396396
test := make([]int, len(origin))
397397
copy(test, origin)
398-
fmt.Printf("runing %s...\n", callName)
398+
fmt.Printf("running %s...\n", callName)
399399
start := time.Now()
400400
sorts.ParallelOddEvenMergeSort(test)
401401
end := time.Since(start)
@@ -409,7 +409,7 @@ func CallCombSort(origin []int, verify []int, callName string) OutputForm {
409409
if COMB_SORT {
410410
test := make([]int, len(origin))
411411
copy(test, origin)
412-
fmt.Printf("runing %s...\n", callName)
412+
fmt.Printf("running %s...\n", callName)
413413
start := time.Now()
414414
sorts.CombSort(test)
415415
end := time.Since(start)

0 commit comments

Comments
 (0)