Naive String Matching Algorithm in C++

This is a C++ Program to perform Naive String matching algorithm. In computer science, string searching algorithms, sometimes called string matching algorithms, are an important class of string algorithms that try to find a place where one or several strings (also called patterns) are found within a larger string or text.

Here is source code of the C++ Program to Perform Naive String Matching. The C++ program is successfully compiled and run on a Linux system. The program output is also shown below.

```
#include<stdio.h>
```
```
#include<string.h>
```
```
void search(char *pat, char *txt)
```
```
{
```
```
    int M = strlen(pat);
```
```
    int N = strlen(txt);
```
```
 
```

    /* A loop to slide pat[] one by one */

```
    for (int i = 0; i <= N - M; i++)
```
```
    {
```
```
        int j;
```
```
 
```

        /* For current index i, check for pattern match */

```
        for (j = 0; j < M; j++)
```
```
        {
```
```
            if (txt[i + j] != pat[j])
```
```
                break;
```
```
        }
```

        if (j == M) // if pat[0...M-1] = txt[i, i+1, ...i+M-1]

```
        {
```

            printf("Pattern found at index %d \n", i);

```
        }
```
```
    }
```
```
}
```
```
 
```

/* Driver program to test above function */

```
int main()
```
```
{
```
```
    char *txt = "AABAACAADAABAAABAA";
```
```
    char *pat = "AABA";
```
```
    search(pat, txt);
```
```
    return 0;
```
```
}
```

Output:

$ g++ StringMatchingNaive.cpp
$ a.out
 
Pattern found at index 0 
Pattern found at index 9 
Pattern found at index 13 
------------------
(program exited with code: 0)
Press return to continue

Sanfoundry Global Education & Learning Series – 1000 C++ Programs.

Here’s the list of Best Books in C++ Programming, Data Structures and Algorithms.

If you find any mistake above, kindly email to [email protected]

« Prev - C++ Program to Check Whether a Given Points are Colinear or Not

» Next - C++ Program to Implement the RSA Algorithm

Related Posts:

Recommended Articles: