摘要:
View Code 1 var i,k,n:longint; 2 a:array[1..100000]of longint; 3 4 procedure qsort(l,r:longint); 5 var i,j,m,t:longint; 6 begin 7 if l=r then exit; 8 i:=l; j:=r; m:=a[k]; 9 repeat10 while a[i]<m do inc(i);11 while a[j]>m do dec(j);12 if i<j then13 begin14 t:=a[i]; a... 阅读全文