It's a bit of a tricky situation I'm in, but I have an array like this:
const nums = [32, -3, 62, 8, 121, -231, 62, 13];
and need to replace them by their corresponding ascending index. The above example should yield:
[4, 1, 5, 2, 7, 0, 6, 3]
The solution I've come up with is this:
const nums = [32, -3, 62, 8, 121, -231, 62, 13];
const numsCopy = nums.map(e => e);
// Basic sorting
for (let i = 0; i < numsCopy.length; i++) {
    for (let j = 0; j < numsCopy.length; j++) {
        if (numsCopy[i] < numsCopy[j]) {
            let t = numsCopy[j];
            numsCopy[j] = numsCopy[i];
            numsCopy[i] = t;
        }
    }
}
for (let i = 0; i < numsCopy.length; i++) {
    let sortedValue = numsCopy[i];
    nums[nums.indexOf(sortedValue)] = i;
}
Problems arise however when I change `nums` to include a value `nums.length > n >= 0`. The call `nums.indexOf(...)` may return a faulty result, as it may have already sorted an index, even though it exists somewhere in the array.
If you replace `nums` with these values, `-231` will have an index of `2` for some reason...
const nums = [32, -3, 62, 7, 121, -231, 62, 13, 0];
> [5, 1, 6, 3, 8, 2, 7, 4, 0]

const sort = array => [...array.keys()].sort((a, b) => array[a] - array[b]);
const fn = array => sort(sort(array));
console.log(...fn([32, -3, 62, 8, 121, -231, 62, 13])); // 4 1 5 2 7 0 6 3
console.log(...fn([-1, 3, 1, 0, 2, 9, -2, 7])); // 1 5 3 2 4 7 0 6

const sortIndicesByValue = array => {
  const sorted = [...array].sort((a, b) => a - b);
  return array.map(e => {
    const i = sorted.indexOf(e);
    sorted[i] = null;
    return i;
  })
}
console.log(...sortIndicesByValue([32, -3, 62, 8, 121, -231, 62, 13]));
console.log(...sortIndicesByValue([-1, 3, 0, 0, 2, 9, -2, 7]));