(left, right, nums)
| 10 | }; |
| 11 | |
| 12 | const 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 | |
| 21 | const merge = (left, right, mid, nums) => { |
| 22 | const arr1 = nums.slice(left, mid + 1); |