noip吧 关注：25,203贴子：642,054
不感兴趣
开通SVIP免广告
procedure qsort(p, q : longint);
var i, j, mid, t : longint;
begin
i:=p;j:=q;mid:=a[(i+j) div 2];
repeat
while a[i]<mid do inc(i);
while a[j]>mid do dec(j);
if i<=j then begin
t:=a[i]; a[i]:=a[j]; a[j]:=t;
inc(i);dec(j);
until i>j;
if j>p then qsort(p,j);
if i<q then qsort(i,q);
end;
快排是用分治思想递归实现的排序，我给的是取中点的快速排序，也可以用随机化处理。
var i, j, mid, t : longint;
begin
i:=p;j:=q;mid:=a[(i+j) div 2];
repeat
while a[i]<mid do inc(i);
while a[j]>mid do dec(j);
if i<=j then begin
t:=a[i]; a[i]:=a[j]; a[j]:=t;
inc(i);dec(j);
until i>j;
if j>p then qsort(p,j);
if i<q then qsort(i,q);
end;
快排是用分治思想递归实现的排序，我给的是取中点的快速排序，也可以用随机化处理。
不感兴趣
开通SVIP免广告
百度吃空格！！！
{ This file is part of the Free Pascal run time library. Copyright (c) 1993-2005 by the Free Pascal Development Team
QuickSort Example
See the file COPYING.FPC, included in this distribution, for details about the copyright.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
**********************************************************************}program quicksort;
const{$ifndef MACOS} max = 100000;{$else} max = 1000; {Actually it works with 100000 also, but that might } {lead problems occacionally.}{$endif}
type tlist = array[1..max] of longint;
var data : tlist;
procedure qsort(var a : tlist);
procedure sort(l,r: longint); var i,j,x,y: longint; begin i:=l; j:=r; x:=a[(l+r) div 2]; repeat while a[i]<x do inc(i); while x<a[j] do dec(j); if not(i>j) then begin y:=a[i]; a[i]:=a[j]; a[j]:=y; inc(i); j:=j-1; end; until i>j; if l<j then sort(l,j); if i<r then sort(i,r); end;
begin sort(1,max); end;
var i : longint;begin write('Creating ',Max,' random numbers between 1 and 500000'); randomize; for i:=1 to max do data[i]:=random(500000); writeln; writeln('Sorting...'); qsort(data); writeln; for i:=1 to max do begin write(data[i]:7); if (i mod 10)=0 then writeln; end;end.
{ This file is part of the Free Pascal run time library. Copyright (c) 1993-2005 by the Free Pascal Development Team
QuickSort Example
See the file COPYING.FPC, included in this distribution, for details about the copyright.
This program is distributed in the hope that it will be useful, but WITHOUT ANY WARRANTY; without even the implied warranty of MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE.
**********************************************************************}program quicksort;
const{$ifndef MACOS} max = 100000;{$else} max = 1000; {Actually it works with 100000 also, but that might } {lead problems occacionally.}{$endif}
type tlist = array[1..max] of longint;
var data : tlist;
procedure qsort(var a : tlist);
procedure sort(l,r: longint); var i,j,x,y: longint; begin i:=l; j:=r; x:=a[(l+r) div 2]; repeat while a[i]<x do inc(i); while x<a[j] do dec(j); if not(i>j) then begin y:=a[i]; a[i]:=a[j]; a[j]:=y; inc(i); j:=j-1; end; until i>j; if l<j then sort(l,j); if i<r then sort(i,r); end;
begin sort(1,max); end;
var i : longint;begin write('Creating ',Max,' random numbers between 1 and 500000'); randomize; for i:=1 to max do data[i]:=random(500000); writeln; writeln('Sorting...'); qsort(data); writeln; for i:=1 to max do begin write(data[i]:7); if (i mod 10)=0 then writeln; end;end.
