找第k小的数

#include<bits/stdc++.h>
using namespace std;
int a[100];
int select(int left,int right,int k)
{
    if(left>=right)return a[left];

    int i=left;
    int j=right;
    int prior=a[left];
    while(true)
    {
        while(a[i]<=prior)
        {
            i++;
        }

       while(a[j]>prior)
        {
            j--;
        }

        if(i>=j)break;
        swap(a[i],a[j]);
    }
   if(j-left+1==k)return prior;

   a[left]=a[j];
   a[j]=prior;

    if(j-left+1<k)
    {
        return select(j+1,right,k-j+left-1);
    }
    else
    {
        return select(left,j-1,k);
    }
}
int main()
{
    a[1]=1;
    a[2]=3;
    a[3]=2;
    a[4]=8;
    a[5]=6;
    cout<<select(1,5,4);
}