如何在不使用排序方法（排序）或排序算法（冒泡排序、快速排序）的情況下對兩個已排序數組進行排序

你在說什麼——“排序”兩個本身已經排序的數組——被稱為合併。這就是你這樣做的方式：

function merge( left = [] , right = [] )  {
  const merged = new Array( left.length + right.length );

  let i = 0 ;
  let j = 0 ;
  let k = 0 ;

  // while both lists have items
  while ( i < left.length && j < right.length ) {
    const x = left[i];
    const y = right[j];

    if ( x <= y ) {
      merged[k++] = x;
      ++i;
    } else {
      merged[k++] = y;
      ++j;
    }

  }

  // if the left list still has items, take them
  while ( i < left.length ) {
    merged[k++] = left[ i++ ];
  }

  // if the right list still has items, take them
  while ( j < right.length ) {
    merged[k++] = right[ j++ ];
  }

  return merged;
}