shaker.pas

Implementations of different methods of sorting: BinaryInsertions.pas BubbleSort.pas HeapSort.p

Procedure SheikerSort;

Var J,K,L,R,T:Word;
Begin
  L:=2;R:=N;K:=N;
  Repeat
   For J:=R Downto  L do
    If X[J-1]> X[J] Then
      Begin
        T:=X[J-1];
        X[J-1]:=X[J];
        X[J]:=T;
        K:=J;
      End;
   L:=K+1;
   For J:=L to  R do
    If X[J-1]> X[J] Then
      Begin
        T:=X[J-1];
        X[J-1]:=X[J];
        X[J]:=T;
        K:=J;
      End;
    R:=K-1;

   Until L>R;

End;