给定初始数组:
上面的图,结合下面的代码,简单不赘述了。
#include<stdio.h>
void quickSort(int a[], int left, int right)
{
int i = left;
int j = right;
int temp = a[left];
if (left >= right)
return;
while (i != j)
{
while (i < j&&a[j] >= temp)
j--;
if (j > i)
a[i] = a[j];//a[i]已经赋值给temp,所以直接将a[j]赋值给a[i],赋值完之后a[j],有空位
while (i < j&&a[i] <= temp)
i++;
if (i < j)
a[j] = a[i];
}
a[i] = temp;//把基准插入,此时i与j已经相等R[low..pivotpos-1].keys≤R[pivotpos].key≤R[pivotpos+1..high].keys
quickSort(a, left, i - 1);/*递归左边*/
quickSort(a, i + 1, right);/*递归右边*/
}
int main()
{
int a[9] = { 23,46,0,8,11,18 };
int i;
quickSort(a, 0, 5);/*排好序的结果*/
for (i = 0; i < 8; i++)
printf("%4d", a[i]);
getchar();
return 0;
}
图来自:
https://blog.csdn.net/nrsc272420199/article/details/82587933