非递归快排

防鄙视系列

#include<iostream>
#include<deque>
#include<utility>

using namespace std;

void norecursion_QuickSort(int*,int);
int partition(int*,int,int);
int main()
{
    int buf[]={112,332,1,200,123,-1,23214};
    norecursion_QuickSort(buf,sizeof(buf)/4);
    int m;
    return 0;
}

void norecursion_QuickSort(int*buf,int amount)
{
    
    typedef pair<int,int> range;
    deque<range>* pd=new deque<range>();
    int middle=partition(buf,0,amount-1);
    range lrg(0,middle-1),rrg(middle+1,amount-1);
    pd->push_back(lrg);
    pd->push_back(rrg);

    while(!pd->empty())
    {
        range rg=pd->front();
            pd->pop_front();
        if(rg.first<rg.second)
        {
            int mid=partition(buf,rg.first,rg.second);
            pd->push_back(range(rg.first,mid-1));
            pd->push_back(range(mid+1,rg.second));

        }
    }

    
}

int partition(int*buf,int p,int q)
{
    int key=buf[q];
    int j=p-1;

    for(int i=p;i<q;i++)
    {
        if(buf[i]<=key)
            std::swap(buf[++j],buf[i]);
    }
    std::swap(buf[++j],buf[q]);
    return j;
}