uses
  Crt;
const
  N = 10;
  ROZSAH = 100;
var
  vstup : array[1..N] of integer;
  i  : integer;

procedure qsort(l, r, pivot : integer);
var
  i, j : integer;
  pom : integer;
begin
  j:=r; i:=l;
  while i <= pivot do begin
    if (vstup[i] > vstup[pivot]) then
      while j >= pivot do begin
        if (vstup[j] < vstup[pivot]) then begin
          pom := vstup[i];
          vstup[i] := vstup[j];
          vstup[j] := pom;
        end;
        dec(j);
      end;
    inc(i);
  end;
  if ((pivot-l) > 1) then
    qsort(l,pivot,((pivot-l) div 2)+l);
  if ((r-pivot) > 1) then
    qsort(pivot,r,((r-pivot) div 2)+pivot);
end;


begin
  {inicializace pole}
  randomize;
  clrscr;
  writeln('Vstupni nesetridene pole:');
  for i:=1 to N do begin
    vstup[i]:=random(ROZSAH);
    write(vstup[i],' ');
  end;

  writeln('Setridene pole:');
  qsort(1,N,N div 2);
  for i:=1 to N do
    write(vstup[i],' ');
  writeln;
end.