insertionborder.pas

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

for i:= 2 to N do
 if a[i-1]>a[i] then 
  begin a[0]:= a[i];          {*}
      j:= i-1;
       while a[j]>a[0] do         {**}  
     begin a[j+1]:= a[j];
      j:= j-1;
         end;
  a[j+1]:= a[0];
 end;