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
|
package sort
import (
"algorithms/ds"
"sync"
)
func ParallelMerge(a ds.ArrayList) ds.ArrayList {
aux := make(ds.ArrayList, len(a))
parallelMerge(a, aux, 0, len(a)-1)
return a
}
func parallelMerge(a, aux ds.ArrayList, lo, hi int) {
mid := lo + (hi-lo)/2
defer merge(a, aux, lo, mid, hi)
if hi-lo <= 1000 {
mergeSort(a, aux, lo, mid)
mergeSort(a, aux, mid+1, hi)
return
}
var wg sync.WaitGroup
wg.Add(2)
go func() {
parallelMerge(a, aux, lo, mid)
wg.Done()
}()
go func() {
parallelMerge(a, aux, mid+1, hi)
wg.Done()
}()
wg.Wait()
}
|
