-
Notifications
You must be signed in to change notification settings - Fork 0
/
main.go
88 lines (68 loc) · 1.56 KB
/
main.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
package main
import (
"flag"
"fmt"
"github.com/moritzschramm/sorting-algos-go/algos"
"github.com/moritzschramm/sorting-algos-go/generator"
"os"
"time"
)
var (
LENGTH = int(1e2)
MAX_RAND = int(1e3)
)
func main() {
algoName := parseFlags()
a := generator.Generate(LENGTH, MAX_RAND)
algo := getSortingAlgorithmByName(algoName)
fmt.Println(a)
fmt.Println("---------------------------------------------------")
start := time.Now()
algo(a)
elapsed := time.Since(start)
fmt.Println(a)
fmt.Printf("Execution time: %s\n", elapsed)
}
func listAlgos() {
fmt.Println("insertion-sort")
fmt.Println("merge-sort")
fmt.Println("quicksort")
fmt.Println("heapsort")
//fmt.Println("timsort")
}
func getSortingAlgorithmByName(name string) func([]int) {
switch name {
case "insertion-sort":
return algos.InsertionSort
case "merge-sort":
return algos.MergeSort
case "quicksort":
return algos.QuickSort
case "heapsort":
return algos.HeapSort
//case "timsort":
// return algos.TimSort
default:
fmt.Println("Unknown algorithm")
os.Exit(1)
return func(a []int) {}
}
}
func parseFlags() string {
length := flag.Int("len", LENGTH, "The length of the array to be sorted")
max := flag.Int("rand", MAX_RAND, "The maximum randomly generated value")
flag.Parse()
LENGTH = *length
MAX_RAND = *max
args := flag.Args()
if len(args) != 1 {
fmt.Println("Expecting _exactly_ one sorting algorithm as argument. Use argument 'list' to list all algorithms.")
os.Exit(1)
}
name := args[0]
if name == "list" {
listAlgos()
os.Exit(0)
}
return name
}