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

const T=4;

var I,J,K,S : INDEX;
    M : 1..T;
    H : array[1..T] of integer;
    X : integer;

begin
  H[1] := 9;
  H[2] := 5;
  H[3] := 3;
  H[4] := 1;
  for M := 1 to T do
  begin
    K := H[M];
    S := -K;
    for I := K+1 to N do
    begin
      X := A[I];
      J := I-K;
      if S=0 then S := -K;
      S := S+1;
      A[S] := X;
      while X<A[J] do
      begin
        A[J+K] := A[J];
        J := J-K
      end;
      A[J+K] := X
    end
  end
end;  {Procedura SHELLSORT}