insertionsort.pas

Implementations of different methods of sorting: BinaryInsertions.pas BubbleSort.pas HeapSort.p

procedure InsertionSort(N: integer);
var
    B: array [1 .. n] of integer;
    i, j: integer;

begin

    for i:=0 to N do begin

        j:=i;

        while (j>1) and (B[j-1]>A[i]) do begin
            B[j]:=B[j-1];
            j:=j-1;
        end;

        B[j]:=A[i];

    end;

    A := B;

end;

================================================================================

Procedure Vstavka(Var a : Array1);
Var
  i, j,e,g:integer;
Begin
  for i:=2 to c do
    begin
      e:=A[i];
      j:=1;
      while (e>a[j]) do
        Inc(j);
      for g:=i-1 downto j do
        a[g+1]:=a[g];
      a[j]:=e;
    end;
End;

================================================================================

for i:= 2 to N do
 if a[i-1]>a[i] then                {*} 
  begin x:= a[i];
      j:= i-1;
   while (j>0)and(a[j]>x) do   {**}
     begin a[j+1]:= a[j];
        j:= j-1;
          end;
  a[j+1]:= x;
 end;