-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathalgorithm.go
More file actions
70 lines (54 loc) · 1.35 KB
/
algorithm.go
File metadata and controls
70 lines (54 loc) · 1.35 KB
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
package algorithm
import (
"github.com/stsh89/algorithm/problems"
"github.com/stsh89/algorithm/random"
"github.com/stsh89/algorithm/sortings"
)
func New(numbers []int) Algorithm {
return Algorithm{numbers}
}
type Algorithm struct {
numbers []int
}
func (a *Algorithm) sort(sortStrategy func([]int)) []int {
tmp := make([]int, len(a.numbers))
copy(tmp, a.numbers)
sortStrategy(tmp)
return tmp
}
func (a *Algorithm) GetNumbers() []int {
return a.numbers
}
func (a *Algorithm) SetNumbers(numbers []int) {
a.numbers = numbers
}
func (a *Algorithm) InsertSort() []int {
return a.sort(sortings.Insert)
}
func (a *Algorithm) BubbleSort() []int {
return a.sort(sortings.Bubble)
}
func (a *Algorithm) MergeSort() []int {
return a.sort(sortings.Merge)
}
func (a *Algorithm) HeapSort() []int {
return a.sort(sortings.Heap)
}
func (a *Algorithm) QuickSort() []int {
return a.sort(sortings.Quick)
}
func (a *Algorithm) RandomizedQuickSort() []int {
return a.sort(sortings.RandomizedQuick)
}
func (a *Algorithm) CountingSort(maxNumber int) []int {
return sortings.Counting(a.numbers, maxNumber)
}
func (a *Algorithm) SubArrayProblem() int {
return problems.SubArray(a.numbers)
}
func (a *Algorithm) PermuteBySorting() []int {
return a.sort(random.PermuteBySorting)
}
func (a *Algorithm) RandomizeInPlace() []int {
return a.sort(random.RandomizeInPlace)
}