怎样在线性时间进行选择的算法

#include <iostream>
#include <time.h>
#include "stdlib.h"
using namespace std;
//随机化分割
int randomized_partition(int* a, int p, int r);
int randomized_select(int* a, int p, int r, int i);
int main()
{
    int arr[10] = {5, 35, 25, 9, 4, 10, 453, 32, 1, 400};
    int n;
    while(true)
    {
        cout<<"输入第n小的数："<<endl;
        cin>>n;
        cout<<randomized_select(arr, 0, 9, n - 1)<<endl;
    }
    return 0;
}
//下标为[p, r]之间的元素
int randomized_partition(int* a, int p, int r)
{
    srand(time(NULL));
    int q = rand()%(r - p + 1) + p;
    swap(a[q],a[r]);
    int j = p-1;
    for(int i = p; i < r; i++)
    {
        if(a[i] < a[r])
        {
            j++;
            swap(a[i],a[j]);
        }
    }
    swap(a[j+1],a[r]);
    return j+1;
}
//迭代
int randomized_select(int* a, int p, int r, int i)
{
    int q = randomized_partition(a, p, r);
    while(p != r)
    {
        if(i == q)
            return a[q];
        else if(i < q)
        {
            r = q - 1;
            q = randomized_partition(a, p, r);
        }
        else
        {
            p = q + 1;
            q = randomized_partition(a, p, r);
        }
    }
    return a[q];
}