void quickSort(int * src ,int size)
{
if(size <= 1) return;
int base = *src;
int *start = src, *end = src+size-1;
while(start < end)
{
if(*start > *end)
{
int tmp = 0;
tmp = *end;
*end = *start;
*start = tmp;
}
if(*start == base)
{
--end;
}
else
{
++start;
}
}
quickSort(src,start-src);
quickSort(start+1,size-(start-src)-1);
}
比较简洁的快速排序
最新推荐文章于 2022-05-01 09:00:00 发布