program project1;

type
  bA = array[0..100] of integer;
  sA = array of integer;
  iA = array of integer;
  mA = array of integer;

var
  baseArray: bA;
  inSertionArray: iA;
  mergeArray: mA;
  simpleArray: sA;
  i, y, z, u, v: integer;

procedure simpleSort(n: integer; base:bA);
var m,x:integer;
begin
  setlength(simpleArray, n);
  m:=n;
  for x := 0 to m - 1 do
    simpleArray[x] := base[x];
  u := 0;
  while u < m-1 do
    if simpleArray[u] <= simpleArray[u + 1] then
      u := u + 1
    else
    begin
      z := simpleArray[u];
      simpleArray[u] := simpleArray[u + 1];
      simpleArray[u + 1] := z;
      u := 0
    end;
end;

procedure insertionSort(s: integer; base:bA);
var i,j,z,e,p:integer;
begin
  setlength(insertionArray, s);
   p:=s;
  for e := 1 to p do
  insertionArray[e] := base[e];
for i:= 0 to p-1 do begin
  j:= i; z:= insertionArray[i+1];
  while (j>=0)and(insertionArray[j]>z) do begin
    insertionArray[j+1]:=insertionArray[j];
    j:=j-1;
    end;
  insertionArray[j+1]:=z;
  end;
end;

procedure mergeSort(var x,y:array of integer; l: integer; base:bA);
var c,i:integer;

begin

end;


begin
  randomize;
  for i := 0 to 100 do
    baseArray[i] := Random(1998)-999;
  readln(y);
  simpleSort(y, baseArray);
  insertionSort(y, baseArray);
  writeln();
  for v := 0 to y - 1 do
    begin
    write('Array sorted using simplesort:',simpleArray[v]);
    writeln(' Array sorted using insertionsort:',insertionArray[v]);
    end;
  readln;
end.