MCPcopy Create free account
hub / github.com/neetcode-gh/leetcode / mergeSort

Function mergeSort

javascript/0912-sort-an-array.js:12–19  ·  view source on GitHub ↗
(left, right, nums)

Source from the content-addressed store, hash-verified

10};
11
12const mergeSort = (left, right, nums) => {
13 if (left === right) return nums;
14
15 const mid = Math.floor((left + right) / 2);
16 mergeSort(left, mid, nums);
17 mergeSort(mid + 1, right, nums);
18 return merge(left, right, mid, nums);
19};
20
21const merge = (left, right, mid, nums) => {
22 const arr1 = nums.slice(left, mid + 1);

Callers 3

mergeSortMethod · 0.85
sortArrayMethod · 0.85
sortArrayFunction · 0.85

Calls 1

mergeFunction · 0.70

Tested by

no test coverage detected