[code=C/C++]
#include <iostream>
#include <vector>
using namespace std;
const int r = 5;
void insertsort(vector<int> &vint,int begin,int end)
{
int j=0;
int temp;
for(int i=begin;i!=end;i++)
{
temp=(vint)[i];
j=i- 1;
while(j>=begin && temp<(vint)[j])
{
(vint)[j+1]=(vint)[j];
j--;
}
(vint)[j+1]=temp;
}
}
int Partition(vector<int> &A,int begin,int &end)
{
end--;
int i = begin +1;
int temp = A[begin];
while(true)
{
while(true)
{
if(i<end&& A[i] <= temp)
++i;
else
break;
}
while(true)
{
if(A[end]>temp&& end>=0)
--end;
else
break;
}
if(i<end)
{
int v;
v =A[i];
A[i]=A[end];
A[end]=v;
}
else
return end;
}
}
int Select2( vector<int>& A,int begin,int end,int k)
{
int Acount = end - begin ;
int v = 0 ,temp1,temp;
if((end-begin)<=r)
{
insertsort(A,begin,end);
return (begin+k-1);
}
while(true)
{
for(int i =0; i!=Acount/r; ++i)
{
insertsort(A,begin+(i)*r,begin+(i+1)*r);
temp = A[begin+i];
A[begin+i] = A[begin+(i)*r+r/2];
A[begin+(i)*r+r/2] = temp;
}
if((Acount/r)%2 ==1)
v = Select2(A,begin,begin+Acount/r,(1+(Acount/r)/2));
else
v = Select2(A,begin,begin+Acount/r,(Acount/r)/2);
temp1 = A[begin];
A[begin] = A[v];
A[v] = temp1;
v = end;
Partition(A,begin,v);
if(k== (v-begin +1))
return v;
else if(k>v-begin+1)
{
k = k-(v - begin+1);
begin = v+1;
}
else
{
end = v;
}
}
}
int main()
{
vector<int> C;
for (int i=0; i!=600; ++i)
{
C.push_back(rand());
}
cout<<Select2(C,2,C.size(),1)<<endl;
for(int k=1;k!=C.size()+1;++k)
{
cout<<"第"<<k<<"小元素为:" <<Select2(C,0,C.size(),k)<<endl;
}
system("pause");
return 0;
}
[/code]