快速排序用while消去尾递归

#include <iostream>
using namespace std;
const long MAXSIZE = 5000;
typedef struct
{
    int r[MAXSIZE+1];
    int length;
}SqList;
int partition(SqList &L, int low, int high)
{
    int count = 0;
    L.r[0] = L.r[low];
    int pivotkey = L.r[low];
    while(low < high)
    {
        while(low < high && L.r[high] > pivotkey) --high;
        {L.r[low] = L.r[high]; count++;}
        while(low < high && L.r[low] < pivotkey) ++low;
        {L.r[high] = L.r[low]; count++;}
    }
    L.r[low] = L.r[0];
    cout<<"-----"<<count<<endl;
    return low;
}
void qSort(SqList &L, int low, int high)
{
    /*
    if(low < high)
    {
        int pivotloc = partition(L, low, high);
        qSort(L, low, pivotloc-1);
        qSort(L, pivotloc+1, high);
    }
    */
    //用while循环消去尾递归
    while(low < high)
    {
        int pivotloc = partition(L, low, high);
        qSort(L, low, pivotloc-1);
        low = pivotloc+1;
    }
}
int main()
{
    SqList list;
    list.length = 6;
    list.r[0] = 0;
    list.r[1] = 2;
    list.r[2] = 1;
    list.r[3] = 4;
    list.r[4] = 5;
    list.r[5] = 3;
    qSort(list, 1, 5);
    for(int i=1; i<list.length; i++)
        cout<<list.r[i]<<endl;
    return 0;
}