sort1.pas

关于课件 好多种结构的算法 等等 大家自己看吧

program sort1(input,output,g);
{use array}
const maxsize=100;
TYPE
 book=Record
       xm : string[16];
       sh : integer ;
       sm : string[16];
       dj : real ;
       Sl : integer ;
      END  ;
 bokfl=file of book;
VAR
 st : string; 
 g : bokfl;
 n:integer;
 Procedure scan(var f:bokfl);
 var
   x:book;
 begin
   while not eof(f) do
    begin
     read(f,x);
     with x do
      begin
        writeln( xm :20,sh:6,sm:20,dj:5:2,Sl:6);
      end;
    end ;
 end;

Procedure sort(var f:bokfl; n:integer);
var
 x:array[1..maxsize] of book;
 i,j:integer;
 temp:book;
 h:bokfl;
begin
 for i:=1 to n do
   read(f,x[i]);
 for i:=1 to n-1 do
   for j:=i+1 to n do
    if x[i].sh>x[j].sh then
      begin
       temp:=x[i];
       x[i]:=x[j];
       x[j]:=temp;
      end;
 assign(h,'sortbook');
 rewrite(h);
 for i:=1 to n do
  begin
    write(h,x[i]);
  end;
 reset(h);
 writeln;
 writeln('data after sort:');
 scan(h);
end ;
BEGIN
  st:='books';
  assign(g,st);
  reset(g);
  writeln('data before sort:');
  scan(g);
  reset(g);
  n:=filesize(g);
  sort(g,n);
  close(g);
END.