算法导论习题9.2-3

RANDOMIZED-SELECT的循环版本#include <iostream>
#include <ctime>
using namespace std;
void exchange(int &a, int &b)
{
int temp;
temp = a;
a = b;
b = temp;
}
int RANDOMIZED_PARTITION(int A[], int p, int r)
{
if(p==r)
return A[p];
int i;
srand(time(NULL));
i = rand()%(r-p+1) + p;
exchange(A[i],A[r]);
int x = A[r],j,temp;
i = p-1;
for(j=p;j<r;j++)
{
if(A[j]<=x)
{
i++;
exchange(A[i],A[j]);
}
}
exchange(A[i+1],A[r]);
return i+1;
}
int RANDOMIZED_SELECT(int A[], int p, int r, int i)
{
if(p==r)
return A[p];
int q = RANDOMIZED_PARTITION(A,p,r);
while(p < r)
{
if(i==q)
return A[q];
if(q>i)
r = q - 1;
else
p = q + 1;
q = RANDOMIZED_PARTITION(A,p,r);
}
return A[p];
}
void test()
{
int A[] = {0,1,3,5,7,9,2,4,6,8,10};
for(int i = 1; i<=10; ++i)
cout<<RANDOMIZED_SELECT(A,1,10,i)<<" ";
cout<<endl;
}
int main()
{
test();
return 0;
}