delphi 插入排序类
procedure InsertSort(var N:array of integer);
var
I,J,IntTemp:integer;
begin
for I := 1 to High(N) do
begin
for J := I downto 1 do
begin
if N[J-1]>N[J] then
begin
IntTemp:=N[J-1];
N[J-1]:=N[J];
N[J]:=IntTemp;
end;
end;
end;
end;