- 01
- 02
- 03
- 04
- 05
- 06
- 07
- 08
- 09
- 10
- 11
- 12
- 13
- 14
- 15
- 16
- 17
- 18
- 19
- 20
- 21
- 22
- 23
- 24
- 25
- 26
- 27
- 28
- 29
- 30
- 31
- 32
- 33
- 34
- 35
- 36
- 37
- 38
- 39
- 40
- 41
- 42
- 43
- 44
- 45
// qsort.inc:
procedure SortRow(var A: array of T);
procedure sort(l,r: integer);
var
i,j: integer;
x,y: T;
begin
i := l;
j := r;
x := a[random(r-l+1)+l];
repeat
while LESS(a[i],x) do inc(i);
while LESS(x,a[j]) do dec(j);
if i<=j then begin
y := a[i];
a[i] := a[j];
a[j] := y;
inc(i);
dec(j);
end;
until i>=j;
if l<j then sort(l,j);
if i<r then sort(i,r);
end;
begin
Sort(Low(A), High(A));
end;
// unit1.pas
T = TPoint;
function LESS(const a,b: T): boolean;
begin
result := a.x<b.x;
end;
{$I qsort.inc}
var
a: array of TPoint;
begin
...
SortRow(a);
...
end;