heapsort.pas

来自「Implementations of different methods of 」· PAS 代码 · 共 38 行

{ Просеивание }

for i:= (N div 2)downto 1 do
 begin j:= i;
  while j<=(N div 2) do
    begin k:= 2*j;
      if (k+1<=N) and (a[k]<a[k+1])
         then k:= k+1;
      if a[k]>a[j] 
         then begin x:= a[j];
            a[j]:= a[k];
            a[k]:= x;
            j:= k
         end
      else break
     end
end;

{ }

for i:= N downto 2 do
 begin x:= a[1];
   a[1]:= a[i];
   a[i]:= x;
   j:= 1;
  while j<=((i-1)div 2) do
   begin k:= 2*j;
     if (k+1<=i-1) and (a[k]<a[k+1])
      then k:= k+1;
     if a[k]>a[j] 
      then begin x:= a[j];
          a[j]:= a[k];
          a[k]:= x;
          j:= k
      end
        else break
   end
end;