Code:
#include iostream
#include string.h
using namespace std;
int main()
{
char org[100], dup[100];
int i, j, k = 0, len_org, len_dup;
cout << "NOTE:Strings are accepted only till blank space.";
cout << "\nEnter Original String:";
fflush(stdin);
cin >> org;
fflush(stdin);
cout << "Enter Pattern to Search:";
cin >> dup;
len_org = strlen(org);
len_dup = strlen(dup);
for (i = 0; i <= (len_org - len_dup); i++)
{
for (j = 0; j < len_dup; j++)
{
//cout<<"comparing '"<
if (org[i + j] != dup[j])
break;
}
if (j == len_dup)
{
k++;
cout << "\nPattern Found at Position: " << i;
}
}
if (k == 0)
cout << "\nError:No Match Found!";
else
cout << "\nTotal Instances Found = " << k;
return 0;
}
Output:
NOTE:Strings are accepted only till blank space.
Enter Original String:ThisC++programperformsnaivestringmatchingwithoutusinganyspecificlibraryfunctions.Atextandapatternisgivenasinput.Thepatternissearchedforinthetextandallinstancesofthepatternaregivenasoutput.h
Enter Pattern to Search:in
Pattern Found at Position: 30
Pattern Found at Position: 38
Pattern Found at Position: 50
Pattern Found at Position: 100
Total Instances Found = 4
------------------
(program exited with code: 0)
Press return to continue
More C++ Programs:
