Отсротировать фамилии в алфавитном порядке

var a:array[1..100] of string;
     n,i,j:integer;
     s:string;
.....................................
for k:=1 to n-1 do
for i:=1 to n-k do
If a[i]>a[i+1] then
 begin
  s:=a[i];
  a[i]:=a[i+1];
  a[i+1]:=s
 end;

Program FamSort;
 Const cmax=100;
 Type tNames=Array [1..cMax] of string;
 Var name:tNames;
         InFile, OutFile:text;
 
Procedure FamSortir(var mas:tNames);
  var i,j:integer; 
          s:string;
   begin
    For i:=1 to  cmax-1 do  
     for j:=1 to cmax-i do 
      if mas[j]>mas[j+1] then begin 
       s:=mas[j];
        mas[j]:=mas[j+1];
       mas[j+1]:=s;
      end;
   end;
 
 
 BEGIN
   Assign(InFIle, 'Фамилии.txt'); Reset(InFile);
   Assign(OutFile, 'SortFam.txt'); Rewrite(OutFile);
   While not EOF(InFile) do begin
     For var i:=1 to cMax do begin
       Read(InFile, name[i]);
        If EoLn(InFIle) then Readln(InFile);
     end;
    end;
   FamSortir(name);
  For var i:=1 to cmax do 
  if name[i]<>'' then Writeln(OutFile, name[i]);
 Close(InFile); Close(OutFile);
 END.

Program FamSort;
Const cmax=100;
Type tNames=Array [1..cMax] of string;
Procedure FamSortir(var mas:tNames;n:integer);
var i,j:integer;
      s:string;
begin
For i:=1 to  n-1 do
for j:=1 to n-i do
if mas[j]>mas[j+1] then
 begin
  s:=mas[j];
  mas[j]:=mas[j+1];
  mas[j+1]:=s;
 end;
end;
Var name:tNames;
    InFile, OutFile:text;
    n:integer;
BEGIN
Assign(InFIle, 'Фамилии.txt'); Reset(InFile);
Assign(OutFile, 'SortFam.txt'); Rewrite(OutFile);
n:=0;
While not seekeof(InFile) do
 begin
  inc(n);
  Read(InFile, name[n]);
 end;
close(InFile);
FamSortir(name,n);
For var i:=1 to n do
Writeln(OutFile, name[i]);
Close(OutFile);
END.