快排

#include<stdio.h>
void QuickSort(int* a,int low,int high);
int FindPos(int* a,int low,int high);
int main()
{
int a[6]={2,1,0,5,4,3};
int i;
QuickSort(a,0,5);
for(i=0;i<6;++i)
printf("%d ",a[i]);
printf("\n");
return 0;
}
void QuickSort(int* a,int low,int high)
{
int pos;
if(low<high)
{
pos=FindPos(a,low,high);
QuickSort(a,low,pos-1);
QuickSort(a,pos+1,high);
}
}
int FindPos(int* a,int low,int high)
{
int val=a[low];
while(low<high)
{
while(low<high&&a[high]>=val)
{
--high;
}
a[low]=a[high];
while(low<high&&a[low]<=val)
{
++low;
}
a[high]=a[low];

}
a[low]=val;
return high;//high等于low

}

转载于:https://www.cnblogs.com/pascal-poincare/p/5701707.html