MCPcopy
hub / github.com/HuberTRoy/leetCode / sort2

Function sort2

Array/KthLargestElementInAnArray.js:76–83  ·  view source on GitHub ↗
(arr)

Source from the content-addressed store, hash-verified

74}
75
76function sort2(arr) {
77 if (arr.length <= 8) {
78 return sort(arr)
79 }
80 let sp = split(arr)
81 // return sp.reduce((a,b) => merge(a,b))
82 return merge(sort2(sp[0]), sort2(sp[1]))
83}
84
85
86

Callers 1

findKthLargestFunction · 0.85

Calls 3

sortFunction · 0.85
splitFunction · 0.85
mergeFunction · 0.85

Tested by

no test coverage detected