|
1 | 1 | package main |
2 | 2 |
|
3 | 3 | import ( |
4 | | - "../GoLang/bubblesort" |
5 | | - "../GoLang/exponenciacao" |
6 | | - "../GoLang/fatorial" |
7 | | - "../GoLang/fibonacci" |
8 | | - "../GoLang/hanoi" |
9 | | - "../GoLang/heapsort" |
10 | | - "../GoLang/caixeiroviajante" |
11 | | - "../GoLang/insertionsort" |
12 | | - "../GoLang/mergesort" |
13 | | - "../GoLang/selectionsort" |
14 | | - "../GoLang/shellsort" |
15 | | - "../GoLang/radixsort" |
16 | | - "../GoLang/quicksort" |
17 | | - "../GoLang/combsort" |
18 | | - "../GoLang/cocktailsort" |
19 | | - "../GoLang/countingsort" |
20 | | - "../GoLang/gnomesort" |
21 | 4 | "fmt" |
| 5 | + |
| 6 | + "../go/bubblesort" |
| 7 | + "../go/caixeiroviajante" |
| 8 | + "../go/calculatepi" |
| 9 | + "../go/cocktailsort" |
| 10 | + "../go/combsort" |
| 11 | + "../go/countingsort" |
| 12 | + "../go/exponenciacao" |
| 13 | + "../go/fatorial" |
| 14 | + "../go/fibonacci" |
| 15 | + "../go/gnomesort" |
| 16 | + "../go/hanoi" |
| 17 | + "../go/heapsort" |
| 18 | + "../go/insertionsort" |
| 19 | + "../go/mergesort" |
| 20 | + "../go/quicksort" |
| 21 | + "../go/radixsort" |
| 22 | + "../go/selectionsort" |
| 23 | + "../go/shellsort" |
22 | 24 | ) |
23 | 25 |
|
24 | 26 | func main() { |
25 | | - fmt.Println("Fibonacci : ", fibonacci.Fibonacci(9), "\n") |
26 | | - fmt.Println("Exponenciacao : ", exponenciacao.Exponenciacao(5, 5), "\n") |
27 | | - fmt.Println("Fatorial : ", fatorial.Fatorial(6), "\n") |
| 27 | + fmt.Println("Fibonacci : ", fibonacci.Fibonacci(9)) |
| 28 | + fmt.Println("Exponenciacao : ", exponenciacao.Exponenciacao(5, 5)) |
| 29 | + fmt.Println("Fatorial : ", fatorial.Fatorial(6)) |
28 | 30 | fmt.Println("Torre de Hanoi : ") |
29 | 31 | hanoi.Hanoi(0, 2, 1, 3) |
30 | 32 |
|
31 | 33 | caixeiroviajante.Run() |
32 | 34 |
|
33 | 35 | slice := []int{5, 2, 1, 6, 9, 8, 7, 3, 4} |
34 | 36 | fmt.Println("Slice : ", slice) |
35 | | -bubblesort.BubbleSort(slice) |
36 | | - fmt.Println("BubbleSort : ", slice, "\n") |
| 37 | +bubblesort.BubbleSort(slice) |
| 38 | + fmt.Println("BubbleSort : ", slice) |
37 | 39 |
|
38 | 40 | slice = []int{1, 3, 2, 9, 7, 8, 5, 6, 4} |
39 | 41 | fmt.Println("Slice : ", slice) |
40 | | -selectionsort.SelectionSort(slice) |
41 | | - fmt.Println("SelectionSort : ", slice, "\n") |
| 42 | +selectionsort.SelectionSort(slice) |
| 43 | + fmt.Println("SelectionSort : ", slice) |
42 | 44 |
|
43 | 45 | slice = []int{9, 8, 7, 5, 1, 2, 4, 3, 6} |
44 | 46 | fmt.Println("Slice : ", slice) |
45 | | -insertionsort.InsertionSort(slice) |
46 | | - fmt.Println("InsertionSort : ", slice, "\n") |
| 47 | +insertionsort.InsertionSort(slice) |
| 48 | + fmt.Println("InsertionSort : ", slice) |
47 | 49 |
|
48 | 50 | slice = []int{4, 6, 7, 1, 2, 3, 5, 9, 8} |
49 | 51 | fmt.Println("Slice : ", slice) |
50 | | -mergesort.MergeSort(slice) |
51 | | - fmt.Println("MergeSort : ", slice, "\n") |
| 52 | +mergesort.MergeSort(slice) |
| 53 | + fmt.Println("MergeSort : ", slice) |
52 | 54 |
|
53 | 55 | slice = []int{5, 1, 4, 2, 3, 6, 9, 7, 8} |
54 | 56 | fmt.Println("Slice : ", slice) |
55 | | -shellsort.ShellSort(slice) |
56 | | - fmt.Println("ShellSort : ", slice, "\n") |
| 57 | +shellsort.ShellSort(slice) |
| 58 | + fmt.Println("ShellSort : ", slice) |
57 | 59 |
|
58 | 60 | slice = []int{6, 8, 7, 9, 1, 5, 4, 2, 3} |
59 | 61 | fmt.Println("Slice : ", slice) |
60 | 62 | heapsort.HeapSort1(slice) |
61 | | - fmt.Println("HeapSort1 : ", slice, "\n") |
| 63 | + fmt.Println("HeapSort1 : ", slice) |
62 | 64 |
|
63 | 65 | slice = []int{6, 8, 7, 9, 1, 5, 4, 2, 3} |
64 | 66 | fmt.Println("Slice : ", slice) |
65 | | -heapsort.HeapSort2(slice) |
66 | | - fmt.Println("HeapSort2 : ", slice, "\n") |
| 67 | +heapsort.HeapSort2(slice) |
| 68 | + fmt.Println("HeapSort2 : ", slice) |
67 | 69 |
|
68 | 70 | slice = []int{3, 1, 5, 4, 2, 9, 6, 8, 7} |
69 | 71 | fmt.Println("Slice : ", slice) |
70 | | -radixsort.RadixSort(slice) |
71 | | - fmt.Println("RadixSort : ", slice, "\n") |
| 72 | +radixsort.RadixSort(slice) |
| 73 | + fmt.Println("RadixSort : ", slice) |
72 | 74 |
|
73 | 75 | slice = []int{2, 1, 8, 4, 3, 7, 6, 5, 9} |
74 | 76 | fmt.Println("Slice : ", slice) |
75 | | -quicksort.QuickSort(slice) |
76 | | - fmt.Println("QuickSort : ", slice, "\n") |
| 77 | +quicksort.QuickSort(slice) |
| 78 | + fmt.Println("QuickSort : ", slice) |
77 | 79 |
|
78 | 80 | slice = []int{6, 5, 8, 7, 3, 4, 2, 1, 9} |
79 | 81 | fmt.Println("Slice : ", slice) |
80 | | -combsort.CombSort(slice) |
81 | | - fmt.Println("CombSort : ", slice, "\n") |
| 82 | +combsort.CombSort(slice) |
| 83 | + fmt.Println("CombSort : ", slice) |
82 | 84 |
|
83 | 85 | slice = []int{1, 5, 8, 3, 7, 4, 9, 6, 2} |
84 | 86 | fmt.Println("Slice : ", slice) |
85 | | -cocktailsort.CocktailSort(slice) |
86 | | - fmt.Println("CocktailSort : ", slice, "\n") |
| 87 | +cocktailsort.CocktailSort(slice) |
| 88 | + fmt.Println("CocktailSort : ", slice) |
87 | 89 |
|
88 | 90 | slice = []int{9, 5, 8, 7, 3, 2, 1, 6, 4} |
89 | 91 | fmt.Println("Slice : ", slice) |
90 | | -countingsort.CountingSort(slice) |
91 | | - fmt.Println("CountingSort : ", slice, "\n") |
| 92 | +countingsort.CountingSort(slice) |
| 93 | + fmt.Println("CountingSort : ", slice) |
92 | 94 |
|
93 | 95 | slice = []int{2, 5, 1, 7, 4, 9, 8, 6, 3} |
94 | 96 | fmt.Println("Slice : ", slice) |
95 | | - gnomesort.GnomeSort(slice) |
96 | | - fmt.Println("GnomeSort : ", slice, "\n") |
| 97 | + gnomesort.GnomeSort(slice) |
| 98 | + fmt.Println("GnomeSort : ", slice) |
| 99 | + |
| 100 | + slice = []int{10, 1000, 100000, 10000000} |
| 101 | + fmt.Println("Slice : ", slice) |
| 102 | + fmt.Println("CalculatePi : ", calculatepi.CalculatePi(slice)) |
97 | 103 | } |
0 commit comments