第k大元素O(n)解法,利用快排+剪枝,直接看代码吧
#include <stdio.h>
int K = 7; //第K大,K>0
int sort(int array[], int low, int high)
{
int key = array[low];
while(low < high)
{
while(low < high && array[high] <= key)
high--;
array[low] = array[high];
while(low < high && array[low] >= key)
low++;
array[high] = array[low];
}
array[low] = key;
return low;
}
void QuickSort(int array[], int low, int high)
{
int pk = array[low];
if(low < high)
{
int p = sort(array, low, high);
if(p == K-1)
return;
else if(p > K-1) //剪枝
QuickSort(array, low, p-1);
else
QuickSort(array, p+1, high);
}
}
int main()
{
int i = 0;
int a[] = {7, 5, 4, 6, 1, 3, 8, 2, 9};
QuickSort(a, 0, 8);
printf("K_Max: %d\n", a[K-1]);
return 0;
}
reference: 严蔚敏等. 数据结构. 清华大学出版社
以上。
(PS. 看来有必要来一次关于排序的大总结了)