计算机学院0101班吴晴 学号200101183000 V=Am]; k=p+1 if(<k) i for(: j<k i do j++,i while(Ank<v); dof k--;i while(Ak>v) if(<k)( temp=A[; Al=A[k]; A(k]=temp: i A[m=A[k] A[k]=v; QUICKSORT(m, k-1) QUICKSORT(k+l, p) void count(int x, int y, void process(int, int)) ∥计算运行时间 t int hl, h2, ml, m2, sl, S2, tl, t2, temp: struct timeb timebuffer struct tm李 newtime time t long time time( &long time newtime =localtime( &long time ) ∥|到初始时的时间 hI=newtime->tm hour. ml=newtime->tm min sI=newtime->tm sec ftime( &timebuffer tl=timebuffer. millitm process(x,y); time( &long time newtime =localtime( &long time ) ∥到结束时的时间 h2=newtime->tm hour: s2=newtime->tm sec ftime( &timebuffer t2=timebuffer. millitm. temp=24*60*1000*(h2-hl)+60000(m2-m1)+1000(52-s1)+12t1;/求时间差,即运行时间 printf("It\t%.5d ms", temp) t int i AMAX+1=INT MAX计算机学院 0101 班 吴晴 学号:2001011830002 2/5 v=A[m]; j=m; k=p+1; if(j<k) { for(;j<k;) { do{ j++; } while(A[j]<v); do{ k--; }while(A[k]>v); if(j<k) { temp=A[j]; A[j]=A[k];A[k]=temp; } } A[m]=A[k]; A[k]=v; QUICKSORT(m,k-1); QUICKSORT(k+1,p); } } void count(int x,int y,void process(int,int)) //计算运行时间 { int h1,h2,m1,m2,s1,s2,t1,t2,temp; struct _timeb timebuffer; struct tm *newtime; time_t long_time; time( &long_time ); newtime = localtime( &long_time ); //得到初始时的时间 h1=newtime->tm_hour; m1=newtime->tm_min; s1=newtime->tm_sec; _ftime( &timebuffer ); t1=timebuffer.millitm; process(x,y); time( &long_time ); newtime = localtime( &long_time ); //得到结束时的时间 h2=newtime->tm_hour; m2=newtime->tm_min; s2=newtime->tm_sec; _ftime( &timebuffer ); t2=timebuffer.millitm; temp=24*60*1000*(h2-h1)+60000*(m2-m1)+1000*(s2-s1)+t2-t1;//求时间差,即运行时间 printf("\t\t%5d ms",temp); } void main() { int i; A[MAX+1]=INT_MAX;