MCPcopy Index your code
hub / github.com/TheAlgorithms/Go / Merge

Function Merge

sort/mergesort.go:47–59  ·  view source on GitHub ↗

Merge Perform merge sort on a slice

(items []T)

Source from the content-addressed store, hash-verified

45
46// Merge Perform merge sort on a slice
47func Merge[T constraints.Ordered](items []T) []T {
48
49 if len(items) < 2 {
50 return items
51
52 }
53
54 var middle = len(items) / 2
55 var a = Merge(items[:middle])
56 var b = Merge(items[middle:])
57 return merge(a, b)
58
59}
60
61func MergeIter[T constraints.Ordered](items []T) []T {
62 for step := 1; step < len(items); step += step {

Callers 1

ParallelMergeFunction · 0.85

Calls 1

mergeFunction · 0.85

Tested by

no test coverage detected