forked from ua-nick/Data-Structures-and-Algorithms
-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathMergeSort.go
More file actions
45 lines (42 loc) · 1.25 KB
/
Copy pathMergeSort.go
File metadata and controls
45 lines (42 loc) · 1.25 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
package MergeSort
func mergeParts(array []int, leftIndex, divideIndex, rightIndex int) {
var tempArray1, tempArray2 []int
for i := leftIndex; i <= divideIndex; i++ {
tempArray1 = append(tempArray1, array[i])
}
for i := divideIndex + 1; i <= rightIndex; i++ {
tempArray2 = append(tempArray2, array[i])
}
arrayIndex := leftIndex
tempArray1Index := 0
tempArray2Index := 0
for tempArray1Index != len(tempArray1) && tempArray2Index != len(tempArray2) {
if tempArray1[tempArray1Index] <= tempArray2[tempArray2Index] {
array[arrayIndex] = tempArray1[tempArray1Index]
tempArray1Index += 1
} else {
array[arrayIndex] = tempArray2[tempArray2Index]
tempArray2Index += 1
}
arrayIndex += 1
}
for tempArray1Index < len(tempArray1) {
array[arrayIndex] = tempArray1[tempArray1Index]
tempArray1Index += 1
arrayIndex += 1
}
for tempArray2Index < len(tempArray2) {
array[arrayIndex] = tempArray2[tempArray2Index]
tempArray2Index += 1
arrayIndex += 1
}
}
func MergeSort(array []int, leftIndex, rightIndex int) {
if leftIndex >= rightIndex {
return
}
divideIndex := int((leftIndex + rightIndex) / 2)
MergeSort(array, leftIndex, divideIndex)
MergeSort(array, divideIndex+1, rightIndex)
mergeParts(array, leftIndex, divideIndex, rightIndex)
}