binaryinsertions.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 x:= a[i];
   left:= 1;
   right:= i-1;
   repeat
     sred:= (left+right)div 2;
     if a[sred]<x then left:= sred+1
         else right:= sred-1;
       until left>right;
   for j:= i-1 downto left do a[j+1]:= a[j];
   a[left]:= x;
 end;