如何在少于O(n^2)的时间内对第二个数组进行排序，并相对于排序后的第二个数组排列第一个数组？

function quickSort(arr) {
  if (arr.length <= 1) {
    return arr;
  }
  
  const pivotIndex = Math.floor(arr.length / 2);
  const pivot = arr.splice(pivotIndex, 1)[0];
  const left = [];
  const right = [];
  
  for (let i = 0; i < arr.length; i++) {
    if (arr[i] <= pivot) {
      left.push(arr[i]);
    } else {
      right.push(arr[i]);
    }
  }
  
  return quickSort(left).concat([pivot], quickSort(right));
}

function sortArrays(arr1, arr2) {
  const sortedArr2 = quickSort(arr2);
  const map = new Map();
  
  for (let i = 0; i < sortedArr2.length; i++) {
    map.set(sortedArr2[i], i);
  }
  
  arr1.sort((a, b) => {
    const indexA = map.get(a);
    const indexB = map.get(b);
    
    if (indexA === undefined && indexB === undefined) {
      return 0;
    } else if (indexA === undefined) {
      return 1;
    } else if (indexB === undefined) {
      return -1;
    } else {
      return indexA - indexB;
    }
  });
  
  return arr1;
}

const arr1 = [5, 2, 8, 3, 1];
const arr2 = [3, 1, 5, 8, 2];
const sortedArr1 = sortArrays(arr1, arr2);

console.log(sortedArr1);  // 输出：[3, 1, 5, 8, 2]