【排序算法模板】快速排序

#include <iostream>
#include <vector>
using namespace std;

void quickSort(vector<int>& nums, const int lpos, const int rpos)
{
    if(lpos < rpos)
    {
        int low = lpos;
        int high = rpos;
        int key = nums[lpos];

        while(low < high)
        {
            while(low < high && nums[high] >= key)
                high--;

            if(low < high)
                nums[low++] = nums[high];

            while(low < high && nums[low] < key)
                low++;

            if(low < high)
                nums[high--] = nums[low];
        }

        nums[low] = key;
        quickSort(nums, lpos, low - 1);
        quickSort(nums, low + 1, rpos);
    }
}

int main()
{
    int a[] = {34,65,12,43,67,5,78,10,34,3,70};
    vector<int> vec(a, a + 11);

    for(int i = 0; i < vec.size(); i++)
        cout<<vec[i]<<" ";
    cout<<endl;

    quickSort(vec, 0, 10);

    for(int i = 0; i < vec.size(); i++)
        cout<<vec[i]<<" ";
    cout<<endl;

}