//冒泡法排序function TForm1.maopao(a: array of integer): tStringlist; var i,j,temp:integer; list: tStringlist; begin for i := high(a) downto low(a) do begin for j := low(a) to i do begin if a[j]>a[j+1] then begin temp := a[j]; a[j] := a[j+1]; a[j+1] := temp; end; end; end; list := tstringlist.Create; for i := low(a) to high(a) do list.Add(inttostr(a[i])); result := list; end;
select max(field) as Max_Value,min(field) as Min_Value from table
var i,j,temp:integer;
list: tStringlist;
begin
for i := high(a) downto low(a) do
begin
for j := low(a) to i do
begin
if a[j]>a[j+1] then
begin
temp := a[j];
a[j] := a[j+1];
a[j+1] := temp;
end;
end;
end;
list := tstringlist.Create;
for i := low(a) to high(a) do
list.Add(inttostr(a[i]));
result := list;
end;
adoquery.sort:='Num DESC';
adoquery.first;
读取Num就是最大值,最小同上。