int Partiotion(int A[], int low, int high) {
int pivot = A[low];
while (low < high) {
while (low < high && A[high] >= pivot)--high;
A[low] = A[high];
while (low < high && A[low] <= pivot)++low;
A[high] = A[low];
}
A[low] = pivot;
return low;
}
void QuickSort(int A[], int low, int high) {
if (low < high) {
int pivotpos = Partiotion(A, low, high);
QuickSort(A, low, pivotpos - 1);
QuickSort(A, pivotpos+1, high);
}
}
算法思想:
分为两步:①每次将待排序列划分为三份,左边都比基准小,基准,右边都比基准大。②对左右两部分递归操作
每次选择第一个数作为基准,然后左右指针从剩下元素的头和尾开始遍历,如果左指针遇到比基准大的就和基准交换,右指针遇到比基准小的就和基准交换。直到左右指针遍历完,将基准和左指针交换。将数组划分成三段。递归操作。
时间复杂度分析:
优化方法:
快速排序的时间效率与左右区间的对称性有很大关系。当左为0右为n-1的情况下(递归树为一棵单枝树),效率为O(n²)。
随机快速排序代码:
int Partiotion(int A[], int low, int high) {
int pivot = rand()%(high-low+1)+low;
swap(A[low], A[pivot]);
while (low < high) {
while (low < high && A[high] >= pivot)--high;
A[low] = A[high];
while (low < high && A[low] <= pivot)++low;
A[high] = A[low];
}
A[low] = pivot;
return low;
}
int RandomizedSelect(int a[], int low, int high, int k) {
if (low == high) {
return a[low];
}
int i = Partiotion(a, low, high);
int j = i - low + 1;
if (k <= j) {
return RandomizedSelect(a, low, i, k);
}
else {
return RandomizedSelect(a, low+1, high, k-j);
}
}