如何在不更改其他元素索引的情况下对数组中的元素进行排序?[复制品]

function oddSort(array) {
  const oddIndicies = [];
  const newArr = array.slice();
  const sortedOdd = array.reduce((arr, val, index) => {
    if (val % 2 !== 0) {
      arr.push(val);
      oddIndicies.push(index);
    }
    return arr;
  }, [])
    .sort((a, b) => a - b);
  while (oddIndicies.length > 0) {
    newArr[oddIndicies.shift()] = sortedOdd.shift();
  }
  return newArr;
}

console.log(oddSort([5, 3, 2, 8, 1, 4]));
console.log(oddSort([5, 3, 2, 8, 1, 4, 11 ]));

function sortOddElements(arr){
   var oddSorted = arr.filter(ele => ele %2 != 0).sort((a, b) => a - b);
   var evenNotSorted = arr.map((ele, idx) => {
       if(ele % 2 != 0){
           return oddSorted.shift(); 
       }
       return ele;
     });
   return evenNotSorted;
}
var arr = [5, 3, 2, 8, 1, 4];
console.log(sortOddElements(arr));
arr = [5, 3, 2, 8, 1, 4, 11 ];
console.log(sortOddElements(arr));

function myFunction(array) {

    var oddElements = array.reduce((arr, val, index) => {
        if (val % 2 !== 0) {
            arr.push(val);
        }
        return arr.sort(function(a, b){return a - b});
    }, []);

    var index = 0;
    var finalElements = [];
    for(var i=0; i<array.length; i++) {
        var element = array[i];
        if(element %2 !==0) {
            finalElements.push(oddElements[index]);
            index++;
        } else {
            finalElements.push(element);
        }
    }
    return finalElements;
}
console.log(myFunction([5, 3, 2, 8, 1, 4, 11]));