2019-03-20 随机选择算法

#include
#include
#include
#include
#include
using namespace std;
int Partition(int A[],int left,int right)
{
    int temp=A[left];
    while(lefttemp) right--;
        A[left]=A[right];
        while(leftk) return randSelect(A,left,p-1,k);
    else return randSelect(A,p+1,right,k-M);
}
int main(void)
{
    int maxn=101;
    int a[maxn];
    srand((unsigned)time(NULL));
    int mx1,mx2;
    mx1=1,mx2=100;
    for(int i=1;i+1<=maxn;i++)
    {
        a[i]=(int)round(1.0*rand()/RAND_MAX*(mx2-mx1)+mx1);
    }   
    int n=100;
    for(int i=1;i<=n;i++) cout<