快排:从待排序的n个记录中任意选取一个记录(通常第一个)为分区标准;把所有小于该排序列的记录移动到左边,把所有大于该排序的记录移动到右边,中间放所选记录,称为第一趟排序;然后对前后两个子序列分别重复上述过程,直到所有几里路都排序好。
稳定性:不稳定
平均复杂度:O(nlogn)
#include<stdio.h>
int sort( int * arr, int nLow, int nHigh)
{
int temp = arr[nLow];
while( nLow < nHigh )
{
while( nLow < nHigh )
{
if( arr[nHigh] <= temp )
{
arr[nLow] = arr[nHigh];
nLow ++;
break;
}else
nHigh --;
}
while( nLow < nHigh )
{
if(arr[nLow] > temp )
{
arr[nHigh] = arr[nLow];
nHigh --;
break;
}else
nLow ++;
}
}
arr[nLow] = temp;
return nLow;
}
void QuickSort( int * arr,int low, int high)
{
if(arr == NULL || low > high)
return;
int nStandard;
nStandard = sort(arr,low,high);
QuickSort(arr,low,nStandard -1);
QuickSort(arr,nStandard+1,high);
}
int main()
{
int arr[] = {11,2,12,34,22,25,3};
int nLength = sizeof(arr)/sizeof(int);
printf(" nLength = %d \n",nLength);
QuickSort(arr,0,nLength-1);
for(int i=0;i<nLength;i++)
{
printf(" %d",arr[i]);
}
return 0;
}