废话莫多说,show the code!
void quicklyOrder(int *array, int len)
{
int biger = 0, middle = 0, smaller = 0;//用于记录各分组长度(元素数量)
int *bigGroup = (int*)malloc(sizeof(int)*len);
int *midGroup = (int*)malloc(sizeof(int)*len);
int *smaGroup = (int*)malloc(sizeof(int)*len);//申请三个等长于原数组长度的新数组,接受大于、等于、小于中位的元素
for (int i = 0; i < len; i++)//遍历以分组并记录各组长度
(array[i] == array[len / 2]) ? (midGroup[middle++] = array[i]) : (array[i] > array[len / 2]) ? (bigGroup[biger++] = array[i]) : (smaGroup[smaller++] = array[i]);
if (biger > 1)
quicklyOrder(bigGroup, biger);
if (smaller > 1)
quicklyOrder(smaGroup, smaller);//递归排序至完成
memcpy(array, bigGroup, sizeof(int)*biger);
memcpy(array + biger, midGroup, sizeof(int)*middle);
memcpy(array + biger + middle, smaGroup, sizeof(int)*smaller);//将分组排序完成的元素填回原数组
free(bigGroup);
free(midGroup);
free(smaGroup);//释放申请的内存
bigGroup = NULL;
midGroup = NULL;
smaGroup = NULL;//养成良好习惯
}
PS1:一如快速排序法的缺点,数组特别大的话,这种排序方法会特别吃内存
PS2:是否有必要retrun呢?不是很确定,有没有高手指点指点