search.pas

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

program search(input,output,g);
type
 findtp=integer ;
 fltp=file of findtp;
var
 m:findtp ;
 flag:boolean ;
 g:fltp;
 data:string;
 Procedure scan(var f:fltp);
 var
   x:integer;
 begin
   while not eof(f) do
    begin
     read(f,x);
     write(x:6);
    end;
   writeln;
 end ;

Procedure find(var f:fltp ; n:findtp ; var fg:boolean);
  var 
    x:findtp ;
  begin
   fg:=false ;
   while (fg=false) and (not eof(f)) do
     begin
      read(f,x);
      if x=n then fg:=true ;
     end ;
  end;
begin
 data:='schfile';
 assign(g,data) ;
 reset(g);
 scan(g);
 readln(m);
 reset(g);
 find(g,m,flag);
 writeln(flag);
end .