#include <iostream>
using namespace std;
void quick_sort(int *unsorted,int low,int high)
{
if(low<high)
{
int i=low,j=high,tmp=unsorted[low];
while(i<j)
{
while(i<j && unsorted[j]>=tmp)
j--;
if(i<j)
unsorted[i++]=unsorted[j];
while(i<j && unsorted[i]<tmp)
i++;
if(i<j)
unsorted[j--]=unsorted[i];
}
unsorted[i]=tmp;
quick_sort(unsorted,low,i-1);
quick_sort(unsorted,i+1,high);
}
}
int main()
{
int array[]={36,15,24,63,42,21},i;
int size=sizeof(array)/sizeof(array[0]);
cout<<"排序前:";
for(i=0;i<size;i++)
cout<<array[i]<<" ";
cout<<endl;
quick_sort(array,0,size-1);
cout<<"排序后:";
for(i=0;i<size;i++)
cout<<array[i]<<" ";
cout<<endl;
return 0;
}