| 19 | }; |
| 20 | |
| 21 | const merge = (left, right, mid, nums) => { |
| 22 | const arr1 = nums.slice(left, mid + 1); |
| 23 | const arr2 = nums.slice(mid + 1, right + 1); |
| 24 | |
| 25 | let p1 = 0; |
| 26 | let p2 = 0; |
| 27 | let gp = left; |
| 28 | |
| 29 | while (p1 < arr1.length && p2 < arr2.length) { |
| 30 | if (arr1[p1] < arr2[p2]) { |
| 31 | nums[gp] = arr1[p1]; |
| 32 | p1++; |
| 33 | } else { |
| 34 | nums[gp] = arr2[p2]; |
| 35 | p2++; |
| 36 | } |
| 37 | gp++; |
| 38 | } |
| 39 | |
| 40 | while (p1 < arr1.length) { |
| 41 | nums[gp] = arr1[p1]; |
| 42 | p1++; |
| 43 | gp++; |
| 44 | } |
| 45 | |
| 46 | while (p2 < arr2.length) { |
| 47 | nums[gp] = arr2[p2]; |
| 48 | p2++; |
| 49 | gp++; |
| 50 | } |
| 51 | return nums; |
| 52 | }; |