{模版}快速排序

最新推荐文章于 2022-02-11 16:46:10 发布

FarmerJohnLYH

最新推荐文章于 2022-02-11 16:46:10 发布

阅读量438

点赞数 2

文章标签：快速排序

本文链接：https://blog.csdn.net/FarmerJohnOfZS/article/details/51848259

版权

Min-Qsort.pas

const
        maxn=100000;
var
        n:longint;
        i,j,l:longint;
        a:array[0..maxn] of longint;
procedure swap(var a,b:longint);
var
        c:longint;
begin
        c:=a;a:=b;b:=c;
end;
procedure qsort(l,r:longint);
var
        i,j,mid:longint;
begin
        i:=l; j:=r;
        mid:=a[(i+j)shr 1];
        while(i<=j)do
        begin
                while(a[i]<mid)do inc(i);
                while(a[j]>mid)do dec(j);
                if(i<=j)then
                begin
                        swap(a[i],a[j]);
                        inc(i);dec(j);
                end;
        end;
        if(l<j)then qsort(l,j);
        if(i<r)then qsort(i,r);
end;
begin
        readln(n);
        for i:=1 to n do 
                readln(a[i]);
        qsort(1,n);
        for i:=1 to n do 
                writeln(a[i]);
end.