快速排序

#include<iostream>
#include<cstring>
using namespace std;

int quicksort(int a[],int start,int end,int size)
{
int i=start;
int j=end;
int key=a[start];
if(size<=1)
return 0;
int temp[10];
memcpy(temp,a,10*sizeof(int));
for(int o=start+1;o<=end;o++)
{
if(a[o]<=key)
temp[i++]=a[o];
else
temp[j--]=a[o];
}
temp[i]=key;
memcpy(a,temp,10*sizeof(int));

for(int e=0;e<10;e++)
cout<<a[e]<<" ";
cout<<endl;

quicksort(a,start,i-1,i-start);
quicksort(a,i+1,end,end-i);
return 0;
}

int main()
{
int a[10]={8,2,5,4,7,6,9,3,0,1};
quicksort(a,0,9,10);
for(int i=0;i<10;i++)
cout<<a[i]<<" ";
cout<<endl;
return 0;
}