procedure QUICKSORT(var A:TYPPOLE;     {Razene pole     }
                    N:integer          {Pocet prvku pole});
          {Procedura seradi zadane pole metodou Quick-sort}

  procedure CASTECNEUSPORADANI(K,M:INDEX);

  var I,J : INDEX;
      W,X : integer;

  begin
    I := K;
    J := M;
    X := A[(K+M) div 2];
    repeat
      while A[I]<X do I := I+1;
      while X<A[J] do J := J-1;
      if I<=J then begin
                     W := A[I];
                     A[I] := A[J];
                     A[J] := W;
                     I := I+1;
                     J := J-1
                   end;
    until I>J;
    if K<J then CASTECNEUSPORADANI(K,J);
    if I<M then CASTECNEUSPORADANI(I,M)
  end;  {pomocna procedura CASTECNEUSPORADANI}

begin
  CASTECNEUSPORADANI(1,N)
end;  {Procedura QUICKSORT}
ORT}