delphi 冒泡排序类

procedure BubbleSort(var N:array of integer);
var
  I,J,IntTemp:integer;
begin
  for I := 0 to High(N) do
  begin
    for J := 0 to High(N)-1 do
    begin
      if N[J]>N[J+1] then
      begin
        IntTemp:=N[J];
        N[J]:=N[J+1];
        N[J+1]:=IntTemp;
      end;
    end;
  end;
end;