Lab Pascal

label lab2;

procedure fullsearch();
var i,k,n:integer;
    s:string;
    f:text;
    m:array[1..15] of string;

begin
  writeln('Selected method: Full search. Processing...');
  reset(input,'test.txt');
  rewrite(f,'result_fullsearch.txt');
  i:=1;
  readln(s);
  writeln(f,'Для строки "',s,'" - 0 сравнений');
  m[i]:=s;
  while (i<15) do
  begin
    readln(s);
    k:=1;
    n:=0;
    while (k <= i) and (s <> m[k]) do
    begin
      inc(k);
      inc(n);
    end;
    if (k > i) then
    begin
      inc(i);
      m[i]:=s;
    end
    else inc(n);
    writeln(f,'Для строки "',s,'" - ',n,' сравнений');
  end;
  close(input);
  close(f);
end;

procedure binsearch();
var s:string;
    m:array[1..15] of string;
    i,k,n,l,r,x:integer;
    f:boolean;
    t:text;

begin
  writeln('Selected method: Binary search. Processing...');
  reset(input,'test.txt');
  rewrite(t,'result_binsearch.txt');
  i:=1;
  readln(s);
  writeln(t,'Для строки "',s,'" - 0 сравнений');
  m[i]:=s;
  while (i < 15) do
  begin
    readln(s);
    n:=0;
    l:=1;
    r:=i;
    f:=false;
    while (l <= r) do
    begin
      x:=(l+r) div 2;
      if (m[x] = s) then
      begin
        l:=r+1;
        f:=true;
      end
      else
        if (m[x] > s) then r:=x-1
        else l:=x+1;
      inc(n);
    end;
    if not f then
    begin
      k:=i;
      while (k > 0) and (m[k] > s) do
      begin
        m[k+1]:=m[k];
        dec(k);
      end;
      m[k+1]:=s;
      inc(i);
    end;
    writeln(t,'Для строки "',s,'" - ',n,' сравнений');
  end;
  close(input);
  close(t);
end;

procedure hash();
var s:string;
    hash:array[0..14] of boolean;
    m:array[0..14] of string;
    i,k,n,l,h,u:integer;
    f:boolean;
    t:text;

begin
  writeln('Selected method: Hashing. Processing...');
  reset(input,'test.txt');
  rewrite(t,'result_hash.txt');
  i:=0;
  fillchar(hash,sizeof(hash),0);
  while (i < 15) do
  begin
    readln(s);
    n:=0;
    l:=length(s);
    h:=0;
    for u := 1 to l do
       h :=(h + ord(s[u])) mod 15;
    if (not hash[h]) then
    begin
      hash[h]:=true;
      m[h]:=s;
      inc(i);
    end
    else
    begin
      inc(n);
      f:=false;
      k:=1;
      if (m[h] <> s) then
      while not f do
      begin
        if ((h - k) >= 0) then
          if (not hash[h-k]) then
          begin
            hash[h-k]:=true;
            m[h-k]:=s;
            inc(i);
            f:=true;
          end
          else
          begin
            inc(n);
            if (m[h-k] = s) then f:=true;
          end;
        if (not f) then
          if ((h + k) <= 14) then
            if (not hash[h+k]) then
            begin
              hash[h+k]:=true;
              m[h+k]:=s;
              inc(i);
              f:=true;
            end
            else
            begin
              inc(n);
              if (m[h+k] = s) then f:=true;
            end;
        inc(k);
      end;
    end;
    writeln(t,'Для строки "',s,'" - ',n,' сравнений');
  end;
  close(input);
  close(t);
end;

var k:char;
begin
  writeln('Select the method of data processing:');
  writeln('1. Full search');
  writeln('2. Binary search');
  writeln('3. Hashing');
  lab2:
  readln(k);
  case k of
    '1': fullsearch();
    '2': binsearch();
    '3': hash();
    else
    begin
      writeln('Error! Please type the number from 1 to 3!');
      goto lab2;
    end;
  end;
  writeln('All data were processed.');
end.