C++实现快速排序

C++实现快速排序：

#include<iostream>
#include<time.h>
using namespace std;
int partition(int *a,int p,int r)
{
int key=a[r];
int i=p-1;
for(int j=p;j<=r-1;++j)
{
if(a[j]<=key)
{
i++;
int temp=a[i];
a[i]=a[j];
a[j]=temp;
}
}
int temp1=a[i+1];
a[i+1]=key;
a[r]=temp1;
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);
}
}
int main()
{
cout<<"要输入的数组的个数"<<endl;
int num;
cin>>num;
cin.clear();
srand(time(0));
int *elem=new int[num];
for(int i=0;i!=num;++i)
elem[i]=rand()%100;
quicksort(elem,0,num-1);
for(int i=0;i!=num;++i)
cout<<elem[i]<<" ";
cout<<endl;
delete [] elem;
return 0;
// int a[10]={4,7,2,1,5,3,10,9,6,8};
//quicksort(a,0,9);
//for(int i=0;i!=10;++i)
// cout<<a[i]<<" ";
//cout<<endl;
//return 0;
}