找到第一个元素的确切位置,这个位置将数组分成两部分,再分别对这两部分进行处理。
#include <stdio.h>
#include <stdlib.h>
int FindPivot(int a[], int left, int right)
{
int val = a[left];
while(left < right)
{
while(left < right && a[right] >= val)
right--;
a[left] = a[right];
while(left < right && a[left] <= val)
left++;
a[right] = a[left];
}//after this loop, left must be equal to right
a[left] = val;
return left;
}
void QuickSort(int a[], int left, int right)
{
int pivot;
if (left < right)
{
pivot = FindPivot(a,left,right);
QuickSort(a, left, pivot-1);
QuickSort(a, pivot+1, right);
}
}
int main(void)
{
int a[] = {5,1,4,3,2};
QuickSort(a,0,4);
for (int i = 0; i < 5; i++)
{
printf("%d ",a[i]);
}
printf("\n");
return 0;
}
//One function version
void QuickSort(int a[], int left, int right)
{
if (left < right)
{
int i = left, j = right, val = a[left];
while (i < j)
{
while(i < j && a[j] >= val) // 从右向左找第一个小于val的数
j--;
/*if(i < j)
a[i++] = a[j];*/
a[i] = a[j];
while(i < j && a[i] <= val) // 从左向右找第一个大于等于val的数
i++;
/*if(i < j)
a[j--] = a[i];*/
a[j] = a[i];
}
a[i] = val;
QuickSort(a, left, i - 1);
QuickSort(a, i + 1, right);
}
}