#include<stdio.h>
#include<stdlib.h>
int quick_sort(int a[],int low,int high)
{
if(low<high)
{
int tem,t=a[low];
int l=low,h=high;
while(l<h)
{
while(a[h]>t) h--;
while(a[l]<t) l++;
if(h>l)
{
tem = a[l];
a[l] = a[h];
a[h] = tem;
}
}
quick_sort(a,low,l-1);
quick_sort(a,l+1,high);
}
}
int main()
{
int a[10]={8,3,5,32,56,73,2,64,745,35};
int i;
quick_sort(a,0,9);
for(i=0;i<10;i++)
printf("%d ",a[i]);
system("pause");
}
#include<stdlib.h>
int quick_sort(int a[],int low,int high)
{
if(low<high)
{
int tem,t=a[low];
int l=low,h=high;
while(l<h)
{
while(a[h]>t) h--;
while(a[l]<t) l++;
if(h>l)
{
tem = a[l];
a[l] = a[h];
a[h] = tem;
}
}
quick_sort(a,low,l-1);
quick_sort(a,l+1,high);
}
}
int main()
{
int a[10]={8,3,5,32,56,73,2,64,745,35};
int i;
quick_sort(a,0,9);
for(i=0;i<10;i++)
printf("%d ",a[i]);
system("pause");
}