selection.pas

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

Procedure SelectionSort;
Var
  i, j, Min, MinI : integer;
Begin
  for i:=1 to c do
    begin
      Min:=a[i];
      MinI:=i;
      for j:=i+1 to c do
        if a[j]<Min
          then
            begin
              Min:=a[j];
              MinI:=j;
            end;
      a[MinI]:=a[i];
      a[i]:=Min;
    end;
End;

================================================================================

procedure SelectionSort;
var
    i, j, best_value, best_j: longint;

begin
    for i := 0 to high(a) do begin
        best_value := a[i];
        best_j := i;
        for j := i + 1 to high(a) do begin
            if a[j] < best_value then begin
                best_value := a[j];
                best_j     := j;
            end;
        end;
        a[best_j] := a[i];
        a[i] := best_value;
    end;
end;

================================================================================

for i:= 1 to n-1 do
  begin min_ind:= i;
   for j:= i+1 to n do 
   if a[j]<=a[min_ind]  {***}
      then min_ind:= j;
   if min_ind<>i 
    then begin
     x:= a[i];
     a[i]:= a[min_ind];
     a[min_ind]:= x;
   end;
  end;