void SequentialQuickSort(std::vector<int>::iterator begin, std::vector<int>::iterator end) {
    if (std::distance(begin, end) <= 1)
        return;

    std::vector<int>::iterator pivot = std::partition(begin + 1, end, std::bind2nd(std::less<int>(), *begin));
    std::iter_swap(begin, pivot-1);
    SequentialQuickSort(begin, pivot - 1);
    SequentialQuickSort(pivot, end);
}