Sort elements of an array without modifying the original array

SortAndMaintainOrder.cpp

#include <algorithm>
#include <iostream>

int main()
{
    // Original data won't change order
    const std::vector<int> data{1, 7, 3, 6, 4, 5, 2, 8, 0, 9};
    
    // The objective is to make `data[sortedIndices[i]]` represent
    // the following pseudocode: `sorted(data)[i]`.
    //
    // This means that `sortedIndices` represents the index of each
    // element in `data` if `data` were to be sorted.
    std::vector<int> sortedIndices(data.size());
    
    // This just fills `sortedIndices` with elements:
    // `[0, 1, 2, 3, ..., sortedIndices.size() - 1]`
    std::iota(sortedIndices.begin(), sortedIndices.end(), 0);
    
    // Sort the indices based on elements of `data`
    std::sort(
        sortedIndices.begin(),
        sortedIndices.end(),
        [&](int i, int j) { return data[i] < data[j]; });
    
    // Now we can print the elements of `data` in order
    for (auto sortedIndex : sortedIndices)
    {
        std::cout << data[sortedIndex] << ' ';
    }
    std::cout << std::endl;
}