Golang多线程排序实现快速高效地处理大规模数据（golang线程安全）这都可以

目录前言随机数生成器使用goroutines并发地对各个子数组进行排序合并已排序的子数组得到最终排序结果main 函数控制流程思路性能比较

func randProduce(randNums chan []int, wg *sync.WaitGroup) {
for i :=0; i < 100; i++ {
go rand1(randNums, wg)
}
}
func rand1(randNums chan []int, wg *sync.WaitGroup) {
r :=rand.New(rand.NewSource(time.Now().Unix()))
int1000 :=make([]int, 1000000)
for i :=0; i < 1000000; i++ {
int1000[i]=r.Intn(1000000)
}
randNums <- int1000
wg.Done()
}

func sort0(randNums chan []int, sortNums chan []int, wg *sync.WaitGroup) {
for i :=0; i < 100; i++ {
go sort2(randNums, sortNums, wg)
}
}
func sort2(randNums chan []int, sortNums chan []int, wg *sync.WaitGroup) {
int1000_Old :=<-randNums
sort.Ints(int1000_Old)
sortNums <- int1000_Old
wg.Done()
}

func mergeAll(sortNums chan []int, wg *sync.WaitGroup) []int {
defer wg.Done()
temp2 :=<-sortNums
var temp1 []int
for i :=1; i <=99; i++ {
temp1=make([]int, 1000000*i+1000000)
copy(temp1, temp2)
temp1=merge(temp1, 1000000*i+1000000, <-sortNums, 1000000)
temp2=make([]int, 1000000*i+1000000)
copy(temp2, temp1)
}
return temp2
}
func merge(nums1 []int, m int, nums2 []int, n int) []int {
temp :=make([]int, m)
copy(temp, nums1)
t, j :=0, 0 //t为temp的索引，j为nums2的索引
for i :=0; i < len(nums1); i++ {
if t >=len(temp) {
nums1[i]=nums2[j]
j++
continue
}
if j >=n {
nums1[i]=temp[t]
t++
continue
}
if nums2[j] <=temp[t] {
nums1[i]=nums2[j]
j++
} else {
nums1[i]=temp[t]
t++
}
}
return nums1
}

func main() {
fmt.Println(“开始运行!”)
start :=time.Now() // 获取当前时间
wg :=sync.WaitGroup{}
wg.Add(201)
randNums :=make(chan []int, 100)
sortNUms :=make(chan []int, 100)
go randProduce(randNums, &wg)
go sort0(randNums, sortNUms, &wg)
go mergeAll(sortNUms, &wg)
wg.Wait()
// fmt.Println(l)
elapsed :=time.Since(start)
fmt.Println(“该函数执行完成耗时：”, elapsed)
}

randNums :=make(chan []int, 100)
sortNUms :=make(chan []int, 100)

go randProduce(randNums, &wg)
go sort0(randNums, sortNUms, &wg)

go mergeAll(sortNUms, &wg)

package main
import (
“fmt”
“math/rand”
“sort”
“time”
)
func main() {
fmt.Println(“开始运行!”)
start :=time.Now() // 获取当前时间
randNums :=make(chan int, 10000)
go randProduce1(randNums)
randNums1 :=make([]int, 100000000)
for i :=0; i < 100000000; i++ {
randNums1[i]=<-randNums
}
sort.Ints(randNums1)
elapsed :=time.Since(start)
fmt.Println(“该函数执行完成耗时：”, elapsed)
}
func randProduce1(randNums chan int) {
for i :=0; i < 10000; i++ {
go rand2(randNums)
}
}
func rand2(randNums chan int) {
r :=rand.New(rand.NewSource(time.Now().Unix()))
for i :=0; i < 10000; i++ {
randNums <- r.Intn(10000000)
}
}

您可能感兴趣的文章:Golang多线程爬虫高效抓取大量数据的利器Golang多线程刷票的实现代码