std::vector<int> quickSort(std::vector<int> v, it beg, it end)
{
    if (v.size() < 2)
    {
        return v;
    }
    else
    {
        it ref = v.begin() + v.size() / 2;

        std::vector<int> less, greater;

        for (it i = beg; i != end; ++i)
        {
            if (*i < *ref)
            {
                less.push_back(*i);
            }
            else greater.push_back(*i);
        }

        return ;
    }
}