-
Notifications
You must be signed in to change notification settings - Fork 8
/
Copy pathKMP string matching.c
56 lines (56 loc) · 990 Bytes
/
KMP string matching.c
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
#include <stdio.h>
#include <stdlib.h>
#include <string.h>
int search(char*,char*);
int main()
{
char txt[]="MY NAME IS ALI SUN ZARA MANCHALI";
char pat[] = "MANCHALI";
int pos=search(pat,txt);
if(pos !=-1)
{
printf("\nPATTERN FOUND AT INDEX %d",pos+1);
}
else
{
printf("\nNO MATCH\n");
}
return 0;
}
int search(char*pat,char*txt)
{
int p=strlen(pat);
int t=strlen(txt);
int *d=(int *)malloc(p*sizeof(int));
d[0]=0;
for(int i=0,j=0;i<p;i++)
{
while(j>0 && pat[j]!=pat[i])
{
j=d[j-1];
}
if(pat[j]==pat[i])
{
j++;
d[i]=j;
}
}
for(int i=0,j=0;i<t;i++)
{
while(j<0 && pat[j]!=txt[i])
{
j=d[j-1];
}
if(pat[j]==txt[i])
{
j++;
}
if(j==p)
{
free(d);
return i-j+1;
}
}
free(d);
return -1;
}