快排的源代码,快排是一个神奇的算法,和起泡法的效率真可谓不可同日而语,曾经对比过两种算法,快排在数字个数及多的情况下,表现卓越,起泡法在数字较少的情况下性能优良,空间复杂度低,但个人还是偏爱这种算法,下面是源码:
static int QuickSort(int *array,int x,int y)
{
int low=x,high=y;
int key=array[x];
if(low>high)return 1;
if(low==high)return 0;
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;
QuickSort(array,x,low-1);
QuickSort(array,low+1,y);
return 0;
}