#include <iostream>
using namespace std;
int MyPartition(double values[],int start,int end,int k)
{
int v = values[end];
int j = start - 1;
for( ; start<end; ++start)
{
if(values[start] < v)
{
int temp = values[start];
values[start] = values[++j];
values[j] = temp;
}
}
values[end] = values[++j];
values[j] = v;
return j;
}
int FindTop(double values[],int start,int end,int k)
{
int mid = MyPartition(values,start,end,k);
if(mid == k )
{
return mid;
}else if(mid > k)
{
return FindTop(values,start,mid-1,k);
}else
{
return FindTop(values,mid+1,start,k);
}
}
int FindTopMain(double values[],int len,int k)
{
if(len <= k )
return len;
return FindTop(values,0,len-1,k);
}
int main()
{
double values[] = {1,4,2,6,2,6,8,12,4,545,6,7,112,88,99,11,77,33,11,33,55,78,111};
int i = FindTopMain(values,sizeof(values)/sizeof(double),10);
for(int j = 0 ; j < 10; j++)
{
cout<<values[j]<<endl;
}
return 0;
}