lab3

Program lab3;
const
  n = 10;
type
  Arr = array[1..n] of integer;
var
  A: Arr = (1,2,3,4,5,6,7,8,9,10);
  B: Arr = (1,2,3,4,5,6,7,8,9,10);
  C: Arr = (1,2,3,4,5,6,7,8,9,10);
  i, j, k, buf, min, nmin: integer;
  fl: boolean;


Procedure Vyvod(mas: Arr);
var
  k: integer;
begin
  for k:=1 to n do
    write (mas[k], '  ');
  writeln();
  writeln();
end;

BEGIN
  // Пузырек
  Vyvod(A);
  fl := true;
  while (fl = true) do
  begin
    fl := false;
    for i:=1 to n-1 do
      if (A[i]<A[i+1]) then
      begin
        buf := A[i];
        A[i] := A[i+1];
        A[i+1] := buf;
        fl := true;
      end;
  end;
  Vyvod(A);

  //=================
  // Выбора
  Vyvod (B);
  k:=0;   //сколько нужных чисел стоит на правильном месте
  while (k <>n) do
  begin
    min:=B[1];
    nmin := 1;
    for i:=1 to n-k do
      if (min > B[i]) then
      begin
        min := B[i];
        nmin := i;
      end;
    B[nmin] := B[n-k];
    B[n-k] := min;
    k := k + 1;
  end;
  Vyvod (B);

  //=================
  // Вставки
  Vyvod (C);
  for i:=1 to n-1 do
  begin
    k := i + 1;
    buf := C[k];
    for j:=i+1 downto 2 do
    begin
      if (buf > C[j-1]) then
      begin
        C[j] := C[j-1];
        k := j - 1;
      end;
    end;
    C[k] := buf;
  end;
  Vyvod (C);


END.