数组排序函数

//数组排序

procedure TForm1.ArraySort(var A: array of integer);

var

I, J, T: Integer;

begin

for I := High(A) downto Low(A) do

for J := Low(A) to High(A) - 1 do

if A[J] < A[J + 1] then

begin

T := A[J];

A[J] := A[J + 1];

A[J + 1] := T;

end;

end;