#include "studio.h"
void QuickSort(int a[],int left,int right)
{
int i,j,temp;
i = left;
j = right;
temp = a[left];
if(left > right)
{
return;
}
while(i != j) /*找到最终位置*/
{
while(a[j] >= temp && j > i)
{
j--;
}
if(j>i)
{
a[i ++] = a[j];
}
while(a[i] <=temp && j>i)
i ++;
if(j > i)
a[j--]= a[i];
}
a[i] = temp;
QuickSort(a,left,i-1) /*递归左边*/
QuickSort(a,i+1,right) /*递归右边*/
}
void main()
{
int a[7] = {2,3,9,22,5,6,7};
int i ;
QuickSort(a,0,6);
/*排好序的结果*/
for(i=0;i<7;i++)
printf("4d%",a[i]);
}
void QuickSort(int a[],int left,int right)
{
int i,j,temp;
i = left;
j = right;
temp = a[left];
if(left > right)
{
return;
}
while(i != j) /*找到最终位置*/
{
while(a[j] >= temp && j > i)
{
j--;
}
if(j>i)
{
a[i ++] = a[j];
}
while(a[i] <=temp && j>i)
i ++;
if(j > i)
a[j--]= a[i];
}
a[i] = temp;
QuickSort(a,left,i-1) /*递归左边*/
QuickSort(a,i+1,right) /*递归右边*/
}
void main()
{
int a[7] = {2,3,9,22,5,6,7};
int i ;
QuickSort(a,0,6);
/*排好序的结果*/
for(i=0;i<7;i++)
printf("4d%",a[i]);
}