How do I sort a std::vector by the values of a different std::vector?

by

friol’s approach is good when coupled with yours. First, build a vector consisting of the numbers 1…n, along with the elements from the vector dictating the sorting order:

typedef vector<int>::const_iterator myiter;

vector<pair<size_t, myiter> > order(Index.size());

size_t n = 0;
for (myiter it = Index.begin(); it != Index.end(); ++it, ++n)
    order[n] = make_pair(n, it);

Now you can sort this array using a custom sorter:

struct ordering {
    bool operator ()(pair<size_t, myiter> const& a, pair<size_t, myiter> const& b) {
        return *(a.second) < *(b.second);
    }
};

sort(order.begin(), order.end(), ordering());

Now you’ve captured the order of rearrangement inside order (more precisely, in the first component of the items). You can now use this ordering to sort your other vectors. There’s probably a very clever in-place variant running in the same time, but until someone else comes up with it, here’s one variant that isn’t in-place. It uses order as a look-up table for the new index of each element.

template <typename T>
vector<T> sort_from_ref(
    vector<T> const& in,
    vector<pair<size_t, myiter> > const& reference
) {
    vector<T> ret(in.size());

    size_t const size = in.size();
    for (size_t i = 0; i < size; ++i)
        ret[i] = in[reference[i].first];

    return ret;
}

More Related Contents:

  1. What’s the most efficient way to erase duplicates and sort a vector?
  2. Sorting a vector in descending order
  3. how do you insert the value in a sorted vector?
  4. How to use std::sort with a vector of structures and compare function?
  5. Sorting a std::vector by the string?
  6. Sorting a vector of custom objects
  7. What is the easiest way to initialize a std::vector with hardcoded elements?
  8. Alternative to vector
  9. Why isn’t vector a STL container?
  10. Best way to extract a subvector from a vector?
  11. reduce the capacity of an stl vector
  12. How to sum up elements of a C++ vector?
  13. How to avoid memory leaks when using a vector of pointers to dynamically allocated objects in C++?
  14. Does vector::erase() on a vector of object pointers destroy the object itself?
  15. c++ sort keeping track of indices [duplicate]
  16. Reorder vector using a vector of indices [duplicate]
  17. array vs vector vs list
  18. C++ N nested vectors at runtime
  19. How to downsize std::vector?
  20. C++ convert vector to vector
  21. How can I sort an STL map by value?
  22. What happens if you increment an iterator that is equal to the end iterator of an STL container
  23. Getting a vector into a function that expects a vector
  24. How to sort an STL vector?
  25. Comparing 3 modern c++ ways to convert integral values to strings
  26. std::vector capacity after copying
  27. Is it more efficient to copy a vector by reserving and copying, or by creating and swapping? [duplicate]
  28. Example to use shared_ptr?
  29. STL vectors with uninitialized storage?
  30. “Right” way to deallocate an std::vector object

Leave a Comment