CHUỖI VÀ CÁC BÀI TOÁN TRÊN CHUỖI part 2 potx

Vâ Minh Phæ – Bæ m«n Khoa häc m¸y tÝnh 12
begin
writeln(‘chuoi can tim la:’,p);
end;
Function Bmsearch (p,a:st):integer;
Var
i,j,m,n:integer;
skip :array[1 charno]of interger;
procedure Initskip;
var
i:1 charno;
j:integer;
begin
for i:=1 to charno do skip[i]=m;
for j:=1 to m do
if skip[ord(p[j])]=m then skip[ord(p[j])]=m-j;
end;
begin
m:=length(p);
n:=length(a);
initskip;
i:=m;
j:=m;
repeat
if a[i]=p[j] then
begin
i:=i-1;
j:=j-1;
end;
begin

if m-j+1>skip[ord(a[i])] then i:=i+m-j+1
else i:=i+skip[ord(a[i])];
j:=m;
end;
until (j<1) or (i>n);
if j<1 then Bmsearch:=i+1;{tim thay}
else Bmsearch:=0;
end;

Vâ Minh Phæ – Bæ m«n Khoa häc m¸y tÝnh 13
begin
clrscr;
init;
bmsearch(a,p);
write(‘vi tri cua ky tu dau cua chuoi p trong a la :’,bmsearch(p,a):2) ;
writeln ;
result ;
readln ;
end.

c. Phân tích giải thuật
Số lần so sánh :
Cmax=m+n
Số bước thực hiện trong trường hợp bộ ký tự không nhỏ và chuỗi p không
lớn là:
S=n/m

{$M $4000,0,0}
Program Bai_tap_tren_xau;
uses crt;

type m= array [1 9] of string;
const menu:m=(' 1. Dao nguoc xau ',' 2. Tinh chieu dai cua xau',' 3. Chi so cua
xau',' 4. Lay xau ky tu con',
' 5. In xau khong de quy',' 6. In xau de quy',' 7. Bai 5.2',' 8. Bai 5.5',' 9.
Thoat');
type
infor=char;
ref=^elemen;
elemen=record
info:infor;
link:ref;

Vâ Minh Phæ – Bæ m«n Khoa häc m¸y tÝnh 14
end;
var
first:ref;
const max=1000;
type
stacks=record
index:integer;
data:array[1 max] of integer;
End;

stackc=record
index:integer;
data:array[1 max] of char;
end;
stackR=record
index:integer;
data:array[1 max] of real;

End;
var step:integer;
d,g:ref;
ch1,h,c1:char;
i1,n,f,e,b1,b2:integer;
i:integer;
s:string;
stack:stackc;
kt:boolean;
t:real;
nu,r: integer; stack1:stacks;
{ }

Vâ Minh Phæ – Bæ m«n Khoa häc m¸y tÝnh 15
function themdau(var first:ref;NewInfo:Infor):ref;
var
p:ref;
begin
new(p);
p^.info:=NewInfo;
p^.link:=first;
first:=p;
themdau:=p;
end;
{ }
function themcuoi(var q:ref;NewInfo:Infor):ref;
var
p,scan:ref;
begin
New(p);

p^.Info:=NewInfo;
p^.link:=nil;
if q = nil then
q:=p
else
Begin
scan:=q;
while scan^.link<>nil do
scan:=scan^.link;
scan^.link:=p;
End;
themcuoi:=p;
end;

Vâ Minh Phæ – Bæ m«n Khoa häc m¸y tÝnh 16
{ }
procedure xoadau(var first:ref);
var
p:ref;
begin
if first<>nil then
begin
p:=first;
first:=p^.link;
dispose(p);
end;
end;
{ }
procedure xoacuoi(var first:ref);
var

p,q:ref;
begin
q:=first;
p:=q^.link;
if(first=nil)then
exit;
if(p=nil)then
begin
dispose(q);
first:=nil;
end
else
begin
while(p^.link<>nil) do

Vâ Minh Phæ – Bæ m«n Khoa häc m¸y tÝnh 17
begin
p:=p^.link;
q:=q^.link;
end;
dispose(p);
q^.link:=nil;
end;
end;
{ }
procedure inra(first:ref);
var
p:ref;
begin
p:=first;

while(p<>nil) do
begin
write(p^.info);
p:=p^.link;
end;
end;
{ }
procedure dao(var first:ref);
var
a,b,c:ref;
begin
if(first=nil) then
exit
else
if (first^.link=nil) then

Vâ Minh Phæ – Bæ m«n Khoa häc m¸y tÝnh 18
exit
else
a:=nil;
b:=first;
c:=first^.link;
while(c<>nil) do
begin
b^.link:=a;
a:=b;
b:=c;
c:=c^.link;
end;
b^.link:=a;

first:=b;
end;

{ }
function chieudai(first:ref):integer;
var
dem:integer;
p:ref;
begin
p:=first;
dem:=0;
while(p<>nil) do
begin
p:=p^.link;
dem:=dem+1;
end;

Vâ Minh Phæ – Bæ m«n Khoa häc m¸y tÝnh 19
chieudai:=dem;
end;
{ }
function chiso(first:ref;d:integer):infor;
var
p:ref;
dem:integer;
begin
p:=first;
dem:=1;
while(dem<d) and (p<>nil) do
begin

p:=p^.link;
inc(dem);
end;
if(p=nil) then
chiso:=#0
else
chiso:=p^.info;
end;
{ }
function xaukitucon(var first:ref;p,n:integer):ref;
var
i,dem:integer;
daumoi,duoimoi,temp,q:ref;
begin
dem:=1;
q:=first;
while(dem<p)and(q<>nil)do

Vâ Minh Phæ – Bæ m«n Khoa häc m¸y tÝnh 20
begin
q:=q^.link;
inc(dem);
end;
if(q=nil) then
begin
xaukitucon:=nil;
exit;
end;
new(daumoi);
daumoi^.info:=q^.info;

duoimoi:=daumoi;
for i:=2 to n do
begin
q:=q^.link;
if(q<>nil) then
begin
new(temp);
temp^.info:=q^.info;
duoimoi^.link:=temp;
duoimoi:=temp;
end
else
break;
end;
duoimoi^.link:=nil;
xaukitucon:=daumoi;
end;
{ }

Vâ Minh Phæ – Bæ m«n Khoa häc m¸y tÝnh 21
procedure inxau(first:ref); {khong de quy}
var
p:ref;
begin
p:=first;
while(p<>nil) do
begin
write(p^.info);
p:=p^.link;
end;

end;
{ }
procedure inxaudq(first:ref);
var
p:ref;

begin
p:=first;
if(first=nil) then
exit
else
begin
write(p^.info);
inxaudq(p^.link);
end;
end;
{ }
procedure writestacks(stack:stacks);
var i:integer;

Vâ Minh Phæ – Bæ m«n Khoa häc m¸y tÝnh 22
begin
for i:=0 to stack.index do write(stack.data[i]);
end;
{ }
procedure lnits(var stack:stacks);
begin
stack.index:=0;
end;
{ }

function emptys(var stack:stacks):boolean;
begin
if stack.index=0 then emptys:=true
else emptys:=false;
end;
{ }
function Pushs(var stack:stacks;dt:integer):boolean;
Begin
if stack.index=max+1 then
pushs:=false
else
Begin
inc(stack.index);
pushs:=true;
stack.data[stack.index]:=dt;
end;
End;
{ }
function pops(var stack:stacks;var dt:integer):boolean;
begin