Сортировки элементов массива методом вставки- Pascal(Паскаль)

program ser;
uses crt;
type
    vector = array[1..100] of integer;
var
    x:vector;
    n:word;
procedure ShowArr(x:vector;n:word);
var i:word;
begin
    for i:= 1 to n do
        write(x[i],' ');
    writeln;
end;
procedure InitArr(var x:vector;n:word);
var i:word;
begin
    for i:= 1 to n do
      x[i] := random(100);
end;
procedure InsertSort(var x:vector;n:word);
var
   key,i,j:integer;
 
begin
 
    for j:=2 to n do
    begin
       key := x[j];
        i := j - 1;
        while (i>=1)and(x[i]>key) do
        begin
            x[i+1] := x[i];
            i := i -1;
            x[i+1] := key;
        end;
    end;
end;
begin
write('n=');
readln(n);
randomize;
InitArr(x,n);
ShowArr(x,n);
InsertSort(x,n);
ShowArr(x,n);
readln;
end.

Leave a Comment

1 + = 7