FilesExpand file tree

 master

/

test.c

Copy path

Blame

More file actions

Blame

More file actions

Latest commit

 

History

History

History

executable file

·

43 lines (41 loc) · 1.16 KB

 master

/

test.c

Copy path

Top

File metadata and controls

• Code
• Blame

executable file

·

43 lines (41 loc) · 1.16 KB

Raw

Copy raw file

Download raw file

Open symbols panel

Edit and raw actions

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

#include <stdlib.h>

#include <stdio.h>

#include <string.h>

#include "str_match.h"

void printML(MatchList *ml)

{

while(ml != NULL) {

printf("%d, ", ml->index);

ml = ml->next;

}

}

int main(int argc, char const *argv[])

{

MatchList *ml;

printf("Naive Algorithm\n");

ml = naiveStrMatch("aabcc", "aabccdeefghhaabccccdeghlaabcc");

printf("Matched shift: ");

printML(ml);

printf("\n");

printf("Optimized Naive Algorithm\n");

ml = optimizedNaiveStrMatch("aabcc", "aabccdeefghhaabccccdeghlaabcc");

printf("Matched shift: ");

printML(ml);

printf("\n");

printf("Rabin-Karp Algorithm\n");

ml = rabinKarpStrMatch("aabcc", "aabccdeefghhaabccccdeghlaabcc", 3);

printf("Matched shift: ");

printML(ml);

printf("\n");

printf("Optimized Rabin-Karp Algorithm\n");

ml = optimizedRabinKarpStrMatch("aabcc", "aabccdeefghhaabccccdeghlaabcc", 26, 7);

printf("Matched shift: ");

printML(ml);

printf("\n");

printf("Deterministic Finite Automata Algorithm\n");

ml = dfaStrMatch("aabcc", "aabccdeefghhaabccccdeghlaabcc");

printf("Matched shift: ");

printML(ml);

printf("\n");

free(ml);

}