#include<iostream>
using namespace std;
int Partition(int A[], int l, int h)
{
int low=l,high=h;
int pivotkey = A[l];
while (low < high)
{
while (A[high] >= pivotkey&&high>l)
--high;
A[low] = A[high];
while (A[low] <= pivotkey&&low<high)
++low;
A[high] = A[low];
}
A[low] = pivotkey;
return (low);
}
void QSort(int A[], int low, int high)
{
if (low < high)
{
int pivotloc = Partition(A, low, high);
QSort(A, low, pivotloc - 1);
QSort(A, pivotloc + 1, high);
}
}
int main()
{
int a[10] = { 9 ,3 ,4 ,6,12,15,6,7,9,4};
QSort(a, 0, 9);
for(int i=0;i<sizeof(a)/sizeof(a[0]);++i)
{
cout<<a[i]<<endl;
}
return 0;
}
加粗部分为快速排序要点,其中如
while (A[high] >=pivotkey&&high>l)--high;
作为判断循环时一定要对数组下标进行控制。比如数组A[4]={5,5,6,6}且pivotkey=5,若不对数组下标进行控制,
则为
while (A[high] >=pivotkey)--high;
则会发生high一直将减,直到找到A[high]>=pivotkey。然而此时的high必然小于0,A[high]等效于*(A+high)。