快速排序的递归和非递归实现

/*以递归的方式实现快速排序*/
void quick_sort(int array[],int left,int right)
{
if(left>=right)
return ;
int key = array[left];
int low = left;
int high = right;

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

while(low<high && array[low]<key)
low++;
array[high] = array[low];
}
array[low] = key;
quick_sort1(array,left,low-1);
quick_sort1(array,low+1,right);
}

/*非递归形式的快速排序*/

typedef struct LOCATION{
int left;
int right;
}location;

void quick_sort(int array[],int left,int right)
{
location loc;
stack<location> loc_stack;
int key;
int low,high;

loc.left = left;
loc.right = right;

key = array[left];
low =left;
high =right;

loc_stack.push(loc);
while(!loc_stack.empty()){

loc = loc_stack.top();
loc_stack.pop();

low = loc.left;
high = loc.right;
key = array[low];

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

while(low<high && array[low]<key)
low++;
array[high] = array[low];
}
array[low] = key;

if(low+1 < loc.right){/*不满足递归结束条件*/
location tmp;
tmp.left = low+1;
tmp.right = loc.right;
loc_stack.push(tmp);
}
if(loc.left < low-1){/*不满足递归结束条件*/
location tmp;
tmp.left = loc.left;
tmp.right = low-1;
loc_stack.push(tmp);
}
}
}