-
Notifications
You must be signed in to change notification settings - Fork 3
/
Rabin-Karp.c
53 lines (53 loc) · 1.01 KB
/
Rabin-Karp.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
#include <stdio.h>
#include <string.h>
#define d 256
int search(char pat[], char txt[], int q)
{
int M = strlen(pat);
int N = strlen(txt);
int i, j;
int p = 0;
int t = 0;
int h = 1;
for (i = 0; i < M - 1; i++)
h = (h * d) % q;
for (i = 0; i < M; i++)
{
p = (d * p + pat[i]) % q;
t = (d * t + txt[i]) % q;
}
for (i = 0; i <= N - M; i++)
{
if (p == t)
{
for (j = 0; j < M; j++)
{
if (txt[i + j] != pat[j])
break;
}
if (j == M)
{
printf("%d", i);
return 1;
}
}
if (i < N - M)
{
t = (d * (t - txt[i] * h) + txt[i + M]) % q;
if (t < 0)
t = (t + q);
}
}
printf("-1");
return 0;
}
int main()
{
char txt[50];
char pat[50];
scanf("%s", txt);
scanf("%s", pat);
int q = 101;
search(pat, txt, q);
return 0;
}