showing how to do this

qs.cpp

template <class Iterator, class RandomGenerator>
void QuickSort(Iterator begin, Iterator end, RandomGenerator& generator) {
    if (begin == end) {
        return;
    }
    std::uniform_int_distribution<> dis(0, end - begin - 1);
    auto pivot = *(begin + dis(generator));
    auto first = begin;
    auto last = end - 1;
    if (begin == last) {
        return;
    }
    auto mid = begin;
    while (mid <= last) {
        if (*mid < pivot) {
            std::iter_swap(first, mid);
            ++first;
            ++mid;
        } else if (pivot < *mid) {
            std::iter_swap(mid, last);
            --last;
        } else {
            ++mid;
        }
    }
    ++last;
    QuickSort(begin, first, generator);
    QuickSort(last, end, generator);
}

template <class Iterator>
void Sort(Iterator begin, Iterator end) {
    std::mt19937 generator;
    QuickSort(begin, end, generator);