对大小不是2^n的数组进行合并排序

// index.js
exports.main_handler = async (event, context, callback) => {
  const arr = event.arr; // 输入的数组
  const sortedArr = mergeSort(arr); // 调用归并排序函数进行排序
  return sortedArr;
};

function mergeSort(arr) {
  if (arr.length <= 1) {
    return arr;
  }
  
  const mid = Math.floor(arr.length / 2);
  const left = arr.slice(0, mid);
  const right = arr.slice(mid);
  
  return merge(mergeSort(left), mergeSort(right));
}

function merge(left, right) {
  let i = 0;
  let j = 0;
  const merged = [];
  
  while (i < left.length && j < right.length) {
    if (left[i] < right[j]) {
      merged.push(left[i]);
      i++;
    } else {
      merged.push(right[j]);
      j++;
    }
  }
  
  return merged.concat(left.slice(i)).concat(right.slice(j));
}