给定一个拥有n个数据的无序集合,以及k(1≤k≤n),找出该集合中第k大的值。
最简单粗暴的解法是对这n个数据进行排序,然后取出第k大的值。但这不是一个好的解法,因为排序会占用过多的时间。可以结合快速排序算法的思路,逐步逼近答案。
#include<iostream>
using namespace std;
int quicksort(int *v, int left, int right)
{
if(left < right)
{
int key = v[left];
int low = left;
int high = right;
while(low < high)
{
while(low < high && v[high] <= key)
{
high--;
}
v[low] = v[high];
while(low < high && v[low] >= key)
{
low++;
}
v[high] = v[low];
}
v[low] = key;
return low;
}
}
int main()
{
int a[8]={8,52,24,5,3,78,34,7};
int k = 4; //求第k大的数值
int left = 0;
int right = 7;
int pos = quicksort(a,left,right);
while(pos != k-1)
{
if(pos<k-1)
{
left = pos+1;
pos = quicksort(a,left,right);
}
else
{
right = pos-1;
pos = quicksort(a,left,right);
}
}
cout<<a[pos]<<endl;
return 0;
}
参考:http://www.zybang.com/question/6a2520c4bd524b0d2be7674dd0589441.html
对其解法进行了优化