Сортировка методом выбора

uses crt;
var  A:array[1..100] of integer;     
N,i,m,k,x : integer;
begin
clrscr;
write('количество элементов массива ');          
read(N);
for i:=1 to n do read(A[i]);
for k:=n downto 2 do 
begin
m:=1; { m - место max }
for i:=2 to k do if A[i]>A[m] then m:=i;
x:=A[m]; A[m]:=A[k]; A[k]:=x;
end;
for i:=1 to n do write(A[i],' '); 
end.

type
itp = Longint;
mas = array [0..100] of itp;
Func = procedure ( var A : mas);
 var
 n:longint;

 procedure SelectSort( var A : mas;);
var
  i, j, m : Integer;
 x : itp;
 begin
 for i:= 1 to n-1 do
 begin
 m:=i;
 for j:=i+1 to n do
 if A[j] < A[m] then
 m:=j;
 x:=A[i];
 A[i]:=A[m];
 A[m]:=x;
 end;
 end;

 begin
 write ('n=');
 read(n);
SelectSort(n);
writeln(x);
end.

uses crt;
	const
	SIZE=5;
	var
	a : array [1..SIZE] of integer;
	i : integer;
	min: integer;
        j: integer;
	buf: integer;
	k: integer;
begin
clrscr;
	writeln (' Sortirovka massiva ');
	writeln('Vvedite', SIZE:3,' 4isel  ');
	for k:=1 to SIZE do read(a[k]);
	writeln (' sortirovka');
	for i:=1 to SIZE-1 do
		begin
			min:=i;
			for j:=i+1 to SIZE do
			begin
				if a[ j ] < a[min] then min:= j ;
				buf:=a [ i ];
				a [ i ] :=a [min];
				a [ min ]:=buf;

				for k := 1 to SIZE do write (a [k], ' ');
				writeln;
			end;
		end;
	writeln ( 'massiv otsortirovan ') ;
        readkey;
end.