C语言-快排及其优化
#include <stdio.h>
#include <stdlib.h>
#include <time.h>
void QuickSort(int *arr,int start,int end);
int main(int argc, char** argv)
{
int n;
int i,j,k;
int begintime,endtime;
printf("请输入元素个数:");
scanf("%d",&n);
int arr1[n],arr2[n],arr3[n];
for(i=0;i<n;i++)
{
arr1[i]=rand()%100000;
arr2[i]=arr1[i];
arr3[i]=arr1[i];
}
begintime=clock();
QuickSort_2(arr2,0,n-1);
endtime=clock();
printf("优化1运行时间为:%dms\n",endtime-begintime);
begintime=clock();
QuickSort_3(arr3,0,n-1);
endtime=clock();
printf(