var merge = function (nums1, m, nums2, n) {
  let j = 0;
  let moved = m;

  for (let i = 0; i < m + n; i++) {
    if (nums1[i] >= nums2[j]) {
      for (let k = m + n - 1; k >= i; k--) {
        nums1[k] = nums1[k - 1];
      }
      nums1[i] = nums2[j];
      j++;
      moved++;
    }
  }

  while (j < n) {
    nums1[moved] = nums2[j];
    moved++;
    j++;
  }
};```


Can this be improved further? Just curious.