快排代码

 procedure qsort(l,r:longint);
var i,j,m,p:longint;
begin
  i:=l; j:=r; m:=a[(l+r) div 2];
  repeat
    while a[i]<m do inc(i);
    while a[j]>m do dec(j);
    if i<=j then
    begin p:=a[i]; a[i]:=a[j]; a[j]:=p; inc(i); dec(j); end;
  until i>j;
  if i<r then qsort(i,r);
  if l<j then qsort(l,j);
end;