需要借助栈
typedef int STDatatype;
typedef struct Stack
{
STDatatype* _a;
int _top;//栈顶
int _capacity;//容量
}Stack;
void StackInit(Stack* ps)
{
assert(ps);
ps->_a = NULL;
ps->_capacity = 0;
ps->_top = 0;
}
void StackDestory(Stack* ps)
{
assert(ps);
free(ps->_a);
ps->_a = NULL;
ps->_capacity = 0;
ps->_top = 0;
}
void StackPush(Stack* ps, STDatatype x)
{
assert(ps);
if (ps->_top == ps->_capacity)
{
size_t newcapacity = ps->_capacity == 0 ? 4 : ps->_capacity * 2;
ps->_a = (STDatatype*)realloc(ps->_a, sizeof(STDatatype)*newcapacity);
assert(ps->_a);
ps->_capacity = newcapacity;
}
ps->_a[ps->_top] = x;
ps->_top++;
}
void StackPop(Stack* ps)
{
assert(ps && ps->_top > 0);
ps->_top--;
}
STDatatype StackTop(Stack* ps)
{
assert(ps);
return ps->_a[ps->_top - 1];
}
int StackEmpty(Stack* ps)
{
assert(ps);
return ps->_top == 0 ? 0 : 1;
}
void QuickSortNonR(int* a, int left, int right)
{
Stack st;
StackInit(&st);
StackPush(&st, right);
StackPush(&st, left);
while (StackEmpty(&st) != 0)
{
int begin = StackTop(&st);
StackPop(&st);
int end = StackTop(&st);
StackPop(&st);
int div = PartSort1(a, begin, end);
//[div+1,end]
if (div + 1 <end)//在此区间有元素就进栈
{
StackPush(&st, end);
StackPush(&st, div+1);
}
//[begin,div-1]
if (begin < div - 1)//在此区间有元素就进栈
{
StackPush(&st,div-1);
StackPush(&st, begin);
}
}
}