sortowanie

program BinarneWstaw;

{$APPTYPE CONSOLE}

uses
  System.SysUtils;

var n, i:integer;
    a:array [1..100] of integer;

procedure BinarneWstawianie;
  var i, k, l, p, pom:integer;
  begin
    for i := 2 to n do
    begin
      pom:=a[i];
      l:=1;
      p:=i-1;
      while l<=p do
      begin
        k:=(l+p) div 2;
        if pom<a[k] then
          p:=k-1
        else
          l:=k+1;
      end;
      for k := i-1 downto l do
        a[k+1]:=a[k];
      a[l]:=pom;
    end;
  end;

begin

  randomize;

  write('n (1<n<100) = ');
    readln(n);

  writeln('WYLOSOWANE LICZBY');
  for i := 1 to n do
  begin
    a[i]:=random(500)+2500;
    write(a[i], ' ');
  end;

  BinarneWstawianie;

  writeln;
  writeln('POSORTOWANE LICZBY');
  for i := 1 to n do
    write(a[i], ' ');

  readln;

end.