快速查找数组中第几小的元素

#include<stdio.h>
int patition(int a[],int p,int r)
{
	int x=a[r];
	int i=p-1;
	int j;
	for(j=p;j<=r-1;j++)
	{
		if(a[j]<=x)
		{
			i++;
			int temp=a[j];
			a[j]=a[i];
			a[i]=temp;
		}
	}
	int tem;
	tem=a[i+1];
	a[i+1]=a[r];
	a[r]=tem;
	return i+1;
}
int randomselect(int a[],int p,int r,int i)
{
	if(p==r)
		return a[p];
	int q=patition(a,p,r);
	int k=q-p+1;
	if(i==k)
		return a[q];
	else if(i<k)
		return randomselect(a,p,q-1,i);
	else 
		return randomselect(a,q+1,r,i-k);
}
void main()
{
	int n,i,a[10];
	printf("input the number:\n");
	scanf("%d",&n);
	for(i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);
	}
	int j;
	printf("input the number you want to find:\n");
	scanf("%d",&j);
	printf("the number is %d\n",randomselect(a,1,n,j));
}