产生随机数，测试快排

#include<iostream>
#include<cstdlib>
#include<ctime>
#include<fstream>
#include<algorithm>
using namespace std;
int main()
{
    srand(unsigned(time(0)));
    freopen("random1.txt","w",stdout);
    for(int i = 0 ; i < 1000 ; i++)
    {
        int a = rand() % 100;
        cout<< a <<" ";
    }
    fclose(stdout);

}
#include<iostream>
#include<cstdlib>
#include<ctime>
#include<fstream>
#include<algorithm>
using namespace std;
int fuzhukuaipai(int a[],int i,int j)
{
     int key = a[i];
     while(i<j){

     while(a[j]>=key&&i<j)--j;
     a[i] = a[j];
  while(a[i]<=key&&i<j)++i;
    a[j] = a[i];
    }
    a[i] = key;
    return i;
}
void kuaipai(int a[],int i,int j)
{
        if(i<j)
        {
            int p = fuzhukuaipai(a,i,j);
            kuaipai(a,i,p-1);
            kuaipai(a,p+1,j);
        }
}
int Partition(int a[],int p , int r)
{
    int x = a[r];
    int i = p-1;
    for(int j = p ; j < r ;j++ )
    {
        if(a[j]<=x)
        {
            i ++;
            swap(a[i],a[j]);
        }
    }
    swap (a[i+1],a[r]);
    return i+1;
}
void QuickSort(int a[],int p,int r)
{
    if(p<r)
    {
        int q=Partition(a,p,r);
        QuickSort(a,p,q-1);
        QuickSort(a,q+1,r);
    }
}
void maopao(int a[],int n)
{
    for(int i = 0 ; i < n ; i ++)
    {
        for(int j = i ; j < n ; j++)
        {
            if(a[i]>a[j])swap(a[i],a[j]);
        }
    }
}
int main()
{
    int a[100000] ;
    ifstream fin;
    fin.open("random_number.txt");
    for(int i = 0 ; i < 100000 ; i++)
    {
        fin>>a[i];
    }
    fin.close();
    time_t Start;
    time_t End;
    Start = clock();
   // QuickSort(a,0,100000);
    kuaipai(a,0,100000);
    End = clock();
    cout<<"kuaipai-spend:"<<End-Start<<endl;
//    ofstream fout;
//    fout.open("aftersort.txt");
//    for(int i = 0 ; i < 100000 ; i ++)
//    {
//            fout<<a[i]<<"	";
//    }
fin.open("random_number.txt");
    for(int i = 0 ; i < 100000 ; i++)
    {
        fin>>a[i];
    }
    fin.close();
    Start = clock();
    QuickSort(a,0,100000);
    End = clock();
    cout<<"QuickSort-spend:"<<End-Start<<endl;


    fin.open("random_number.txt");
    for(int i = 0 ; i < 100000 ; i++)
    {
        fin>>a[i];
    }
    fin.close();
    Start = clock();
    sort(a,a+100000);
    End = clock();
    cout<<"Sort-spend:"<<End-Start<<endl;

}